| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Claire Mathieu (eds.) |
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009   |
SODA  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ke Yi, Qin Zhang |
Multi-dimensional online tracking. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anthony Man-Cho So |
Improved approximation bound for quadratic optimization problems with orthogonality constraints. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ping Li |
Compressed counting. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohsen Bayati, Andrea Montanari, Amin Saberi |
Generating random graphs with large girth. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | James Aspnes, Keren Censor |
Approximate shared-memory counting despite a strong adversary. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Magniez, Ashwin Nayak, Peter C. Richter, Miklos Santha |
On the hitting times of quantum versus random walks. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Peres |
The unreasonable effectiveness of martingales. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Williams |
Loopless generation of multiset permutations using a constant number of variables by prefix shifts. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Prosenjit Bose, Eric Y. Chen, Meng He, Anil Maheshwari, Pat Morin |
Succinct geometric indexes supporting point location queries. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, Vahab S. Mirrokni |
Approximating submodular functions everywhere. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen |
Parameterized approximation scheme for the multiple knapsack problem. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenz Minder, Alistair Sinclair |
The extended k-tree algorithm. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriel Nivasch |
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
Stream sampling for variance-optimal estimation of subset sums. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer, Huy L. Nguyen |
Approximate line nearest neighbor in high dimensions. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
Clique-width: on the price of generality. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Matousek, Martin Tancer, Uli Wagner |
Hardness of embedding simplicial complexes in Rd. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters |
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David R. Karger, Debmalya Panigrahi |
A near-linear time algorithm for constructing a cactus representation of minimum cuts. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Aminof, Orna Kupferman, Robby Lampert |
Reasoning about online algorithms with weighted automata. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos |
Decomposition of multiple coverings into more parts. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer |
Overcoming the l1 non-embeddability barrier: algorithms for product metrics. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphan Thomassé |
A quadratic kernel for feedback vertex set. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Ulf Schellbach |
On risks of using cuckoo hashing with simple universal hash classes. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Elkind, Dmitrii V. Pasechnik |
Computing the nucleolus of weighted voting games. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergi Elizalde, Peter Winkler |
Sorting by placement and shift. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Gamarnik, Dmitriy Katz |
Sequential cavity method for computing limits of the log-partition function for lattice models. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Viswanath Nagarajan, Maxim Sviridenko |
On the maximum quadratic assignment problem. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Toniann Pitassi, Nathan Segerlind |
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joel A. Tropp |
Column subset selection, matrix factorization, and eigenvalue optimization. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Golynski |
Cell probe lower bounds for succinct data structures. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ittai Abraham, Yair Bartal, Ofer Neiman |
On low dimensional local embeddings. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ariel Kulik, Hadas Shachnai, Tami Tamir |
Maximizing submodular set functions subject to multiple linear constraints. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf |
Inserting a vertex into a planar graph. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcel R. Ackermann, Johannes Blömer |
Coresets and approximate clustering for Bregman divergences. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Uri Zwick |
A simpler implementation and analysis of Chazelle's soft heaps. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yusuke Kobayashi, Ken-ichi Kawarabayashi |
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Edmonds, Kirk Pruhs |
Scalably scheduling processes with arbitrary speedup curves. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik |
On smoothed k-CNF formulas and the Walksat algorithm. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergio Cabello |
Finding shortest contractible and shortest separating cycles in embedded graphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Strassen |
Probability, algorithms and complexity. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert |
A new approach to incremental topological ordering. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild |
From coding theory to efficient pattern matching. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak |
Collecting weighted items from a dynamic queue. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Siu-Wing Cheng, Man-Kwun Chiu |
Dimension detection via slivers. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Approximating fractional hypertree width. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish Goel, Sanjeev Khanna, Brad Null |
The ratio index for budgeted learning, with applications. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi |
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | William B. Johnson, Assaf Naor |
The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Benjamin Moseley |
Online scheduling to minimize the maximum delay factor. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria-Florina Balcan, Avrim Blum, Yishay Mansour |
Improved equilibria via public service advertising. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Dion Harmon, John Iacono, Daniel Kane, Mihai Patrascu |
The geometry of binary search trees. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moran Feldman, Guy Kortsarz, Zeev Nutov |
Improved approximating algorithms for Directed Steiner Forest. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alon Shalita, Uri Zwick |
Efficient algorithms for the 2-gathering problem. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy M. Chan |
Comparison-based time-space lower bounds for selection. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Jaikumar Radhakrishnan |
Finding duplicates in a data stream. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sudipto Guha, Kamesh Munagala, Peng Shi |
Approximation algorithms for restless bandit problems. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Caragiannis |
Efficient coordination mechanisms for unrelated machine scheduling. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Gregory B. Sorkin |
A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Drmota, Wojciech Szpankowski |
(Un)expected behavior of digital search tree profile. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan O'Donnell, Yi Wu |
3-bit dictator testing: 1 vs. 5/8. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Csaba D. Tóth, Guangwu Xu |
On stars and Steiner stars: II. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Uriel Feige |
On the power of two, three and four probes. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parinya Chalermsook, Julia Chuzhoy |
Maximum independent set of rectangles. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yury Person, Mathias Schacht |
Almost all hypergraphs without Fano planes are bipartite. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Bhalgat, Ramesh Hariharan |
Fast edge orientation for unweighted graphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs |
Speed scaling with an arbitrary power function. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Chazal, Leonidas J. Guibas, Steve Oudot, Primoz Skraba |
Analysis of scalar fields over point cloud data. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mehmet A. Begen, Maurice Queyranne |
Appointment scheduling with discrete random durations. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yury Lifshits, Shengyu Zhang |
Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, Rocco A. Servedio |
Testing halfspaces. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddharth Barman, Shuchi Chawla |
Packing multiway cuts in capacitated graphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Omid Amini, Louis Esperet, Jan van den Heuvel |
A unified approach to distance-two colouring of planar graphs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Moritz Hardt, Satyen Kale |
The uniform hardcore lemma via approximate Bregman projections. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Baharak Rastegari, Anne Condon, Kevin Leyton-Brown |
Stepwise randomized combinatorial auctions achieve revenue monotonicity. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Bruce A. Reed |
A nearly linear time algorithm for the half integral parity disjoint paths packing problem. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Cohen-Steiner, Herbert Edelsbrunner, John Harer, Dmitriy Morozov |
Persistent homology for kernels, images, and cokernels. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Molloy, Bruce A. Reed |
Asymptotically optimal frugal colouring. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikkel Thorup |
String hashing for linear probing. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Boutsidis, Michael W. Mahoney, Petros Drineas |
An improved approximation algorithm for the column subset selection problem. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ehsan Amiri, Gábor Tardos |
High rate fingerprinting codes and the fingerprinting capacity. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Spyros Angelopoulos, Pascal Schweitzer |
Paging and list update under bijective analysis. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Charles Brubaker |
Robust PCA and clustering in noisy mixtures. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Salez, D. Shah |
Optimality of belief propagation for random assignment problem. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein, Michael T. Goodrich, Darren Strash |
Linear-time algorithms for geometric graphs with sublinearly many crossings. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikhail Belkin, Jian Sun, Yusu Wang |
Constructing Laplace operator from point clouds in Rd. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Hazan, Robert Krauthgamer |
How hard is it to approximate the best Nash equilibrium? |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kevin Buchin, Maike Buchin, Yusu Wang |
Exact algorithms for partial curve matching via the Fréchet distance. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna |
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
Line transversals of convex polyhedra in R3. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilia Binder, Mark Braverman |
The complexity of simulating Brownian Motion. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Dvorak, Daniel Král, Robin Thomas |
Coloring triangle-free graphs on surfaces. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger |
Termination criteria for solving concurrent safety and reachability games. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant |
On the complexity of Nash equilibria of action-graph games. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Aurore Amaudruz, Christina Fragouli |
Combinatorial algorithms for wireless information flow. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Diedrich, Klaus Jansen |
Improved approximation algorithms for scheduling with fixed jobs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai Golin, Xiaoming Xu, Jiajin Yu |
A generic top-down dynamic-programming approach to prefix-free coding. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Ferragina, Igor Nitto, Rossano Venturini |
On the bit-complexity of Lempel-Ziv compression. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphael Yuster |
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")