Conferences in DBLP
Richard F. Geary , Rajeev Raman , Venkatesh Raman Succinct ordinal trees with level-ancestor queries. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel K. Blandford , Guy E. Blelloch Compact representations of ordered sets. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Patrascu , Erik D. Demaine Tight bounds for the partial-sums problem. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle , Joe Kilian , Ronitt Rubinfeld , Ayellet Tal The Bloomier filter: an efficient data structure for static support lookup tables. [Citation Graph (0, 0)][DBLP ] Conf ] Ran Mendelson , Mikkel Thorup , Uri Zwick Meldable RAM priority queues and minimum directed spanning trees. [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow , Shuxin Nie Finding a long directed cycle. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Bodirsky , Denys Duchier , Joachim Niehren , Sebastian Miele A new algorithm for normal dominance constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Robert W. Irving , Telikepalli Kavitha , Kurt Mehlhorn , Dimitrios Michail , Katarzyna E. Paluch Rank-maximal matchings. [Citation Graph (0, 0)][DBLP ] Conf ] Jon M. Kleinberg , Mark Sandler , Aleksandrs Slivkins Network failure detection and graph connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Naor , Roy Schwartz The directed circular arrangement problem. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas P. Hayes , Eric Vigoda Variable length path coupling. [Citation Graph (0, 0)][DBLP ] Conf ] David Gamarnik Linear phase transition in random linear constraint satisfaction problems. [Citation Graph (0, 0)][DBLP ] Conf ] Krishnendu Chatterjee , Marcin Jurdzinski , Thomas A. Henzinger Quantitative stochastic parity games. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Kindler , Dan Romik On distributions computable by random walks on graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Achlioptas , Paul Beame , Michael Molloy Exponential bounds for DPLL below the satisfiability threshold. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle Who says you have to look at the input? The brave new world of sublinear computing. [Citation Graph (0, 0)][DBLP ] Conf ] April Rasala Lehman , Eric Lehman Complexity classification of network information flow problems. [Citation Graph (0, 0)][DBLP ] Conf ] Don Coppersmith , Ravi Kumar An improved data stream algorithm for frequency moments. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen , Haim Kaplan Efficient estimation algorithms for neighborhood variance and other moments. [Citation Graph (0, 0)][DBLP ] Conf ] David P. Woodruff Optimal space lower bounds for all frequency moments. [Citation Graph (0, 0)][DBLP ] Conf ] Prasanna Ganesan , Gurmeet Singh Manku Optimal routing in Chord. [Citation Graph (0, 0)][DBLP ] Conf ] José R. Correa , Claire Kenyon Approximation schemes for multidimensional packing. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Bansal , Maxim Sviridenko New approximability and inapproximability results for 2-dimensional Bin Packing. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen , Guochuan Zhang On rectangle packing: maximizing benefits. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Rob van Stee Optimal online bounded space multidimensional packing. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Richard E. Ladner , Tami Tamir Windows scheduling as a restricted version of Bin Packing. [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow Special edges, and approximating the smallest directed k -edge connected spanning subgraph. [Citation Graph (0, 0)][DBLP ] Conf ] Geir Agnarsson , Magnús M. Halldórsson On colorings of squares of outerplanar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Raphael Yuster , Uri Zwick Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. [Citation Graph (0, 0)][DBLP ] Conf ] Yuval Emek , David Peleg Approximating Minimum Max-Stretch spanning Trees on unweighted graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Surender Baswana , Sandeep Sen Approximate distance oracles for unweighted graphs in Õ(n2 ) time. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , John Iacono , Stefan Langerman Retroactive data structures. [Citation Graph (0, 0)][DBLP ] Conf ] Gianni Franceschini Proximity Mergesort: optimal in-place sorting in the cache-oblivious model. [Citation Graph (0, 0)][DBLP ] Conf ] James Allen Fill , Svante Janson The number of bit comparisons used by Quicksort: an average-case analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Kevin C. Zatloukal , Nicholas J. A. Harvey Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Christian Scheideler The hyperring: a low-congestion deterministic data structure for distributed environments. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Suguru Tamaki Improved upper bounds for 3-SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Král Locally satisfiable formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Henry Lin , Tim Roughgarden , Éva Tardos A stronger bound on Braess's Paradox. [Citation Graph (0, 0)][DBLP ] Conf ] R. Ravi , Amitabh Sinha Multicommodity facility location. [Citation Graph (0, 0)][DBLP ] Conf ] Jason McCullough , Eric Torng SRPT optimally utilizes faster machines to minimize flow time. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Elkin A faster distributed protocol for constructing a minimum spanning tree. [Citation Graph (0, 0)][DBLP ] Conf ] Camil Demetrescu , Stefano Emiliozzi , Giuseppe F. Italiano Experimental analysis of dynamic all pairs shortest path algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Kasturi R. Varadarajan , Ganesh Venkataraman Graph decomposition and a greedy algorithm for edge-disjoint paths. [Citation Graph (0, 0)][DBLP ] Conf ] Sashka Davis , Russell Impagliazzo Models of greedy algorithms for graph problems. [Citation Graph (0, 0)][DBLP ] Conf ] Kathie Cameron , Elaine M. Eschen , Chính T. Hoàng , R. Sritharan The list partition problem for graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Gary L. Miller A time efficient Delaunay refinement algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Deepak Bandyopadhyay , Jack Snoeyink Almost-Delaunay simplices: nearest neighbor relations for imprecise points. [Citation Graph (0, 0)][DBLP ] Conf ] Eti Ezra , Micha Sharir Output-sensitive construction of the union of triangles. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan An optimal randomized algorithm for maximum Tukey depth. [Citation Graph (0, 0)][DBLP ] Conf ] Sándor P. Fekete , Marco E. Lübbecke , Henk Meijer Minimizing the stabbing number of matchings, trees, and triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Conrado Martinez , Daniel Panario , Alfredo Viola Adaptive sampling for quickselect. [Citation Graph (0, 0)][DBLP ] Conf ] Fabio Martinelli , Alistair Sinclair , Dror Weitz Fast mixing for independent sets, colorings and other models on trees. [Citation Graph (0, 0)][DBLP ] Conf ] David Galvin , Prasad Tetali Slow mixing of Glauber dynamics for the hard-core model on the hypercube. [Citation Graph (0, 0)][DBLP ] Conf ] René Beier , Berthold Vöcking Probabilistic analysis of knapsack core algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Nayantara Bhatnagar , Dana Randall Torpid mixing of simulated tempering on the Potts model. [Citation Graph (0, 0)][DBLP ] Conf ] Wangqi Qiu , Weiping Shi Minimum moment Steiner trees. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Michelangelo Grigni , Papa Sissokho , Hairong Zhao Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Wenceslas Fernandez de la Vega , Marek Karpinski , Claire Kenyon Approximation schemes for Metric Bisection and partitioning. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Mark H. Overmars , Micha Sharir Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. [Citation Graph (0, 0)][DBLP ] Conf ] Chaitanya Swamy Correlation Clustering: maximizing agreements via semidefinite programming. [Citation Graph (0, 0)][DBLP ] Conf ] Raymond Laflamme Quantum computing. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Thouis R. Jones , Mihai Patrascu Interpolation search for non-independent data. [Citation Graph (0, 0)][DBLP ] Conf ] Umut A. Acar , Guy E. Blelloch , Robert Harper , Jorge L. Vittes , Shan Leung Maverick Woo Dynamizing static algorithms, with applications to dynamic trees and history independence. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Motwani , Dilys Thomas Caching queues in memory buffers. [Citation Graph (0, 0)][DBLP ] Conf ] Ittai Abraham , Dahlia Malkhi , Oren Dobzinski LAND: stretch (1 + epsilon) locality-aware networks for DHTs. [Citation Graph (0, 0)][DBLP ] Conf ] Kirsten Hildrum , John Kubiatowicz , Sean Ma , Satish Rao A note on the nearest neighbor in growth-restricted metrics. [Citation Graph (0, 0)][DBLP ] Conf ] Sriram V. Pemmaraju , Rajiv Raman , Kasturi R. Varadarajan Buffer minimization using max-coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Bansal On minimizing the total flow time on multiple machines. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin Doerr Matrix rounding and approximation. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Baruch Awerbuch , Yossi Azar , Niv Buchbinder , Joseph Naor A general approach to online network optimization problems. [Citation Graph (0, 0)][DBLP ] Conf ] James B. Orlin , Abraham P. Punnen , Andreas S. Schulz Approximate local search in combinatorial optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-François Macq , Michel X. Goemans Trade-offs on the location of the core node in a network. [Citation Graph (0, 0)][DBLP ] Conf ] Howard J. Karloff On the convergence time of a path-vector protocol. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup , Yin Zhang Tabulation based 4-universal hashing with applications to second moment estimation. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Bläser Approximate budget balanced mechanisms with low communication costs for the multicast cost-sharing problem. [Citation Graph (0, 0)][DBLP ] Conf ] Carlos Brito , Elias Koutsoupias , Shailesh Vaya Competitive analysis of organization networks or multicast acknowledgement: how much to wait? [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Grossi , Ankur Gupta , Jeffrey Scott Vitter When indexing equals compression: experiments with compressing suffix arrays and applications. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk Approximate Nearest Neighbor under edit distance via product metrics. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Badoiu , Piotr Indyk Fast approximate pattern matching with few indels via embeddings. [Citation Graph (0, 0)][DBLP ] Conf ] Frédérique Bassino , Julien Clément , Cyril Nicaud Lyndon words with a fixed standard right factor. [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Ferragina , Giovanni Manzini Compression boosting in optimal linear time using the Burrows-Wheeler Transform. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , Manor Mendel Dimension reduction for ultrametrics. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , Manor Mendel Randomized k -server algorithms for growth-rate bounded graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Molloy The pure literal rule threshold and cores in random hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Boris Aronov , Vladlen Koltun Efficient algorithms for bichromatic separability. [Citation Graph (0, 0)][DBLP ] Conf ] Nicole Immorlica , David R. Karger , Maria Minkoff , Vahab S. Mirrokni On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Elkind , Amit Sahai , Kenneth Steiglitz Frugality in path auctions. [Citation Graph (0, 0)][DBLP ] Conf ] Tian-Shyr Dai , Yuh-Dauh Lyuu An exact subexponential-time lattice algorithm for Asian options. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Eubank , V. S. Anil Kumar , Madhav V. Marathe , Aravind Srinivasan , Nan Wang Structural and algorithmic aspects of massive social networks. [Citation Graph (0, 0)][DBLP ] Conf ] Steve Chien A determinant-based algorithm for counting perfect matchings in a general graph. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Ackerman , Gill Barequet , Ron Y. Pinter On the number of rectangular partitions. [Citation Graph (0, 0)][DBLP ] Conf ] René Beier , Artur Czumaj , Piotr Krysta , Berthold Vöcking Computing equilibria for congestion games with (im)perfect information. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Piotr Indyk Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates. [Citation Graph (0, 0)][DBLP ] Conf ] Mordecai J. Golin , Kin Keung Ma Algorithms for infinite huffman-codes. [Citation Graph (0, 0)][DBLP ] Conf ] Ross M. McConnell A certifying algorithm for the consecutive-ones property. [Citation Graph (0, 0)][DBLP ] Conf ] Cristopher Moore , Daniel N. Rockmore , Alexander Russell Generic quantum Fourier transforms. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Quasiconvex analysis of backtracking algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Krauthgamer , James R. Lee Navigating nets: simple algorithms for proximity search. [Citation Graph (0, 0)][DBLP ] Conf ] Jiawei Zhang Approximating the two-level facility location problem via a quasi-greedy approach. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Edmonds , Kirk Pruhs A maiden analysis of Longest Wait First. [Citation Graph (0, 0)][DBLP ] Conf ] Parinya Chalermsook , Jittat Fakcharoenphol , Danupon Nanongkai A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Fedor V. Fomin , Mohammad Taghi Hajiaghayi , Dimitrios M. Thilikos Subexponential parameterized algorithms on graphs of bounded-genus and H -minor-free graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Mohammad Taghi Hajiaghayi Equivalence of local treewidth and linear local treewidth and its algorithmic applications. [Citation Graph (0, 0)][DBLP ] Conf ] Stavros D. Nikolopoulos , Leonidas Palios Hole and antihole detection in graphs. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Testing bipartiteness of geometric intersection graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Loukas Georgiadis , Robert Endre Tarjan Finding dominators revisited: extended abstract. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Winkler How random is the human genome? [Citation Graph (0, 0)][DBLP ] Conf ] Gagan Aggarwal , Michael H. Goldwasser , Ming-Yang Kao , Robert T. Schweller Complexities for generalized models of self-assembly. [Citation Graph (0, 0)][DBLP ] Conf ] Ho-Lin Chen , Qi Cheng , Ashish Goel , Ming-Deh A. Huang , Pablo Moisset de Espanés Invadable self-assembly: combining robustness with efficiency. [Citation Graph (0, 0)][DBLP ] Conf ] Ganeshkumar Ganapathy , Vijaya Ramachandran , Tandy Warnow On contract-and-refine transformations between phylogenetic trees. [Citation Graph (0, 0)][DBLP ] Conf ] Tugkan Batu , Sampath Kannan , Sanjeev Khanna , Andrew McGregor Reconstructing strings from random traces. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , Dongdong Ge , Simai He , Haodong Hu , Ron Y. Pinter , Steven Skiena , Firas Swidan Improved bounds on sorting with length-weighted reversals. [Citation Graph (0, 0)][DBLP ] Conf ] Ernst Althaus , Friedrich Eisenbrand , Stefan Funke , Kurt Mehlhorn Point containment in the integer hull of a polyhedron. [Citation Graph (0, 0)][DBLP ] Conf ] Michel X. Goemans , Jan Vondrák Covering minimum spanning trees of random subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Asaf Shapira A characterization of easily testable induced subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Lap Chi Lau Bipartite roots of graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Anne Berry , Martin Charles Golumbic , Marina Lipshteyn Two tricks to triangulate chordal probe graphs in polynomial time. [Citation Graph (0, 0)][DBLP ] Conf ] Ho-Leung Chan , Tak Wah Lam , Kar-Keung To Non-migratory online deadline scheduling on multiprocessors. [Citation Graph (0, 0)][DBLP ] Conf ] Tim Roughgarden The maximum latency of selfish routing. [Citation Graph (0, 0)][DBLP ] Conf ] Tracy Kimbrel , Baruch Schieber , Maxim Sviridenko Minimizing migrations in fair multiprocessor scheduling of persistent tasks. [Citation Graph (0, 0)][DBLP ] Conf ] Marek Chrobak , Leszek Gasieniec , Dariusz R. Kowalski The wake-up problem in multi-hop radio networks. [Citation Graph (0, 0)][DBLP ] Conf ] Lisa Fleischer A fast approximation scheme for fractional covering problems with variable upper bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Yoo Ah Kim On broadcasting in heterogenous networks. [Citation Graph (0, 0)][DBLP ] Conf ] V. S. Anil Kumar , Madhav V. Marathe , Srinivasan Parthasarathy 0002 , Aravind Srinivasan End-to-end packet-scheduling in wireless ad-hoc networks. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews , Lisa Zhang Routing and scheduling in multihop wireless networks with time-varying channels. [Citation Graph (0, 0)][DBLP ] Conf ] William S. Evans , David G. Kirkpatrick Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaojie Gao , Kamal Jain , Leonard J. Schulman Fair and efficient router congestion control. [Citation Graph (0, 0)][DBLP ] Conf ] Volkan Isler , Sampath Kannan , Sanjeev Khanna Randomized pursuit-evasion with limited visibility. [Citation Graph (0, 0)][DBLP ] Conf ] Noa Agmon , David Peleg Fault-tolerant gathering algorithms for autonomous mobile robots. [Citation Graph (0, 0)][DBLP ] Conf ] Aaron Archer , Jittat Fakcharoenphol , Chris Harrelson , Robert Krauthgamer , Kunal Talwar , Éva Tardos Approximate classification via earthmover metrics. [Citation Graph (0, 0)][DBLP ] Conf ] David B. Shmoys , Chaitanya Swamy , Retsef Levi Facility location with Service Installation Costs. [Citation Graph (0, 0)][DBLP ] Conf ] Otfried Cheong , Alon Efrat , Sariel Har-Peled On finding a guard that sees most and a shop that sells most. [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Robert Beals , Ákos Seress On the diameter of the symmetric group: polynomial bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Cristopher Moore , Daniel N. Rockmore , Alexander Russell , Leonard J. Schulman The power of basis selection in fourier sampling: hidden subgroup problems in affine groups. [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Daniel Stefankovic Simultaneous diophantine approximation with excluded primes. [Citation Graph (0, 0)][DBLP ] Conf ] Qi Cheng Constructing finite field extensions with large order elements. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim von zur Gathen , Igor Shparlinski Polynomial interpolation from multiples. [Citation Graph (0, 0)][DBLP ] Conf ] 