9.8k citations
- California Institute of TechnologyUS178 papers
- University of Maryland, College ParkUS136 papers
- Goddard Space Flight CenterUS134 papers
- Max Planck Institute for Gravitational PhysicsDE126 papers
- Massachusetts Institute of TechnologyUS119 papers
- Pennsylvania State UniversityUS116 papers
- University of WashingtonUS116 papers
- Australian National UniversityAU114 papers
- Centre National de la Recherche ScientifiqueFR114 papers
- University of MichiganUS110 papers
- The University of Western AustraliaAU106 papers
- Northwestern UniversityUS105 papers
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020★ 2 cited
Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth
Christine T. Cheng, Will Rosenbaum
In this paper, we consider the problem of counting and sampling structures in graphs. We define a class of "edge universal labeling problems"---which include proper -colorings,…
cs.DS2008
Fast Arithmetics Using Chinese Remaindering
George Davida, Bruce Litow, Guangwu Xu
In this paper, some issues concerning the Chinese remaindering representation are discussed. Some new converting methods, including an efficient probabilistic algorithm based on a…