Table of Contents

• Succinct ordinal trees with level-ancestor queriesRichard F. Geary, Rajeev Raman, Venkatesh Raman. 1-10 [doi]
• Compact representations of ordered setsDaniel K. Blandford, Guy E. Blelloch. 11-19 [doi]
• Tight bounds for the partial-sums problemMihai Patrascu, Erik D. Demaine. 20-29 [doi]
• The Bloomier filter: an efficient data structure for static support lookup tablesBernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal. 30-39 [doi]
• Meldable RAM priority queues and minimum directed spanning treesRan Mendelson, Mikkel Thorup, Uri Zwick. 40-48 [doi]
• Finding a long directed cycleHarold N. Gabow, Shuxin Nie. 49-58 [doi]
• A new algorithm for normal dominance constraintsManuel Bodirsky, Denys Duchier, Joachim Niehren, Sebastian Miele. 59-67 [doi]
• Rank-maximal matchingsRobert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch. 68-75 [doi]
• Network failure detection and graph connectivityJon M. Kleinberg, Mark Sandler, Aleksandrs Slivkins. 76-85 [doi]
• The directed circular arrangement problemJoseph Naor, Roy Schwartz. 86-95 [doi]
• Variable length path couplingThomas P. Hayes, Eric Vigoda. 103-110 [doi]
• Linear phase transition in random linear constraint satisfaction problemsDavid Gamarnik. 111-120 [doi]
• Quantitative stochastic parity gamesKrishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger. 121-130 [doi]
• On distributions computable by random walks on graphsGuy Kindler, Dan Romik. 131-138 [doi]
• Exponential bounds for DPLL below the satisfiability thresholdDimitris Achlioptas, Paul Beame, Michael Molloy. 139-140 [doi]
• Who says you have to look at the input? The brave new world of sublinear computingBernard Chazelle. 141 [doi]
• Complexity classification of network information flow problemsApril Rasala Lehman, Eric Lehman. 142-150 [doi]
• An improved data stream algorithm for frequency momentsDon Coppersmith, Ravi Kumar. 151-156 [doi]
• Efficient estimation algorithms for neighborhood variance and other momentsEdith Cohen, Haim Kaplan. 157-166 [doi]
• Optimal space lower bounds for all frequency momentsDavid P. Woodruff. 167-175 [doi]
• Optimal routing in ChordPrasanna Ganesan, Gurmeet Singh Manku. 176-185 [doi]
• Approximation schemes for multidimensional packingJosé R. Correa, Claire Kenyon. 186-195 [doi]
• New approximability and inapproximability results for 2-dimensional Bin PackingNikhil Bansal, Maxim Sviridenko. 196-203 [doi]
• On rectangle packing: maximizing benefitsKlaus Jansen, Guochuan Zhang. 204-213 [doi]
• Optimal online bounded space multidimensional packingLeah Epstein, Rob van Stee. 214-223 [doi]
• Windows scheduling as a restricted version of Bin PackingAmotz Bar-Noy, Richard E. Ladner, Tami Tamir. 224-233 [doi]
• Special edges, and approximating the smallest directed ::::k::::-edge connected spanning subgraphHarold N. Gabow. 234-243 [doi]
• On colorings of squares of outerplanar graphsGeir Agnarsson, Magnús M. Halldórsson. 244-253 [doi]
• Detecting short directed cycles using rectangular matrix multiplication and dynamic programmingRaphael Yuster, Uri Zwick. 254-260 [doi]
• Approximating Minimum Max-Stretch spanning Trees on unweighted graphsYuval Emek, David Peleg. 261-270 [doi]
• Approximate distance oracles for unweighted graphs in Õ(n:::2:::) timeSurender Baswana, Sandeep Sen. 271-280 [doi]
• Retroactive data structuresErik D. Demaine, John Iacono, Stefan Langerman. 281-290 [doi]
• Proximity Mergesort: optimal in-place sorting in the cache-oblivious modelGianni Franceschini. 291-299 [doi]
• The number of bit comparisons used by Quicksort: an average-case analysisJames Allen Fill, Svante Janson. 300-307 [doi]
• Family trees: an ordered dictionary with optimal congestion, locality, degree, and search timeKevin C. Zatloukal, Nicholas J. A. Harvey. 308-317 [doi]
• The hyperring: a low-congestion deterministic data structure for distributed environmentsBaruch Awerbuch, Christian Scheideler. 318-327 [doi]
• Improved upper bounds for 3-SATKazuo Iwama, Suguru Tamaki. 328 [doi]
• Locally satisfiable formulasDaniel Král. 330-339 [doi]
• A stronger bound on Braess s ParadoxHenry Lin, Tim Roughgarden, Éva Tardos. 340-341 [doi]
• Multicommodity facility locationR. Ravi, Amitabh Sinha. 342-349 [doi]
• SRPT optimally utilizes faster machines to minimize flow timeJason McCullough, Eric Torng. 350-358 [doi]
• A faster distributed protocol for constructing a minimum spanning treeMichael Elkin. 359-368 [doi]
• Experimental analysis of dynamic all pairs shortest path algorithmsCamil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano. 369-378 [doi]
• Graph decomposition and a greedy algorithm for edge-disjoint pathsKasturi R. Varadarajan, Ganesh Venkataraman. 379-380 [doi]
• Models of greedy algorithms for graph problemsSashka Davis, Russell Impagliazzo. 381-390 [doi]
• The list partition problem for graphsKathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan. 391-399 [doi]
• A time efficient Delaunay refinement algorithmGary L. Miller. 400-409 [doi]
• Almost-Delaunay simplices: nearest neighbor relations for imprecise pointsDeepak Bandyopadhyay, Jack Snoeyink. 410-419 [doi]
• Output-sensitive construction of the union of trianglesEti Ezra, Micha Sharir. 420-429 [doi]
• An optimal randomized algorithm for maximum Tukey depthTimothy M. Chan. 430-436 [doi]
• Minimizing the stabbing number of matchings, trees, and triangulationsSándor P. Fekete, Marco E. Lübbecke, Henk Meijer. 437-446 [doi]
• Adaptive sampling for quickselectConrado Martinez, Daniel Panario, Alfredo Viola. 447-455 [doi]
• Fast mixing for independent sets, colorings and other models on treesFabio Martinelli, Alistair Sinclair, Dror Weitz. 456-465 [doi]
• Slow mixing of Glauber dynamics for the hard-core model on the hypercubeDavid Galvin, Prasad Tetali. 466-467 [doi]
• Probabilistic analysis of knapsack core algorithmsRené Beier, Berthold Vöcking. 468-477 [doi]
• Torpid mixing of simulated tempering on the Potts modelNayantara Bhatnagar, Dana Randall. 478-487 [doi]
• Minimum moment Steiner treesWangqi Qiu, Weiping Shi. 488-495 [doi]
• Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphsArtur Czumaj, Michelangelo Grigni, Papa Sissokho, Hairong Zhao. 496-505 [doi]
• Approximation schemes for Metric Bisection and partitioningWenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon. 506-515 [doi]
• Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disksPankaj K. Agarwal, Mark H. Overmars, Micha Sharir. 516-525 [doi]
• Correlation Clustering: maximizing agreements via semidefinite programmingChaitanya Swamy. 526-527 [doi]
• Quantum computingRaymond Laflamme. 528 [doi]
• Interpolation search for non-independent dataErik D. Demaine, Thouis R. Jones, Mihai Patrascu. 529-530 [doi]
• Dynamizing static algorithms, with applications to dynamic trees and history independenceUmut A. Acar, Guy E. Blelloch, Robert Harper, Jorge L. Vittes, Shan Leung Maverick Woo. 531-540 [doi]
• Caching queues in memory buffersRajeev Motwani, Dilys Thomas. 541-549 [doi]
• LAND: stretch (1 + epsilon) locality-aware networks for DHTsIttai Abraham, Dahlia Malkhi, Oren Dobzinski. 550-559 [doi]
• A note on the nearest neighbor in growth-restricted metricsKirsten Hildrum, John Kubiatowicz, Sean Ma, Satish Rao. 560-561 [doi]
• Buffer minimization using max-coloringSriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan. 562-571 [doi]
• On minimizing the total flow time on multiple machinesNikhil Bansal. 572-574 [doi]
• Matrix rounding and approximationBenjamin Doerr. 575-576 [doi]
• A general approach to online network optimization problemsNoga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor. 577-586 [doi]
• Approximate local search in combinatorial optimizationJames B. Orlin, Abraham P. Punnen, Andreas S. Schulz. 587-596 [doi]
• Trade-offs on the location of the core node in a networkJean-François Macq, Michel X. Goemans. 597-604 [doi]
• On the convergence time of a path-vector protocolHoward J. Karloff. 605-614 [doi]
• Tabulation based 4-universal hashing with applications to second moment estimationMikkel Thorup, Yin Zhang. 615-624 [doi]
• Approximate budget balanced mechanisms with low communication costs for the multicast cost-sharing problemMarkus Bläser. 625-626 [doi]
• Competitive analysis of organization networks or multicast acknowledgement: how much to wait?Carlos Brito, Elias Koutsoupias, Shailesh Vaya. 627-635 [doi]
• When indexing equals compression: experiments with compressing suffix arrays and applicationsRoberto Grossi, Ankur Gupta, Jeffrey Scott Vitter. 636-645 [doi]
• Approximate Nearest Neighbor under edit distance via product metricsPiotr Indyk. 646-650 [doi]
• Fast approximate pattern matching with few indels via embeddingsMihai Badoiu, Piotr Indyk. 651-652 [doi]
• Lyndon words with a fixed standard right factorFrédérique Bassino, Julien Clément, Cyril Nicaud. 653-654 [doi]
• Compression boosting in optimal linear time using the Burrows-Wheeler TransformPaolo Ferragina, Giovanni Manzini. 655-663 [doi]
• Dimension reduction for ultrametricsYair Bartal, Manor Mendel. 664-665 [doi]
• Randomized ::::k::::-server algorithms for growth-rate bounded graphsYair Bartal, Manor Mendel. 666-671 [doi]
• The pure literal rule threshold and cores in random hypergraphsMichael Molloy. 672-681 [doi]
• Efficient algorithms for bichromatic separabilityPankaj K. Agarwal, Boris Aronov, Vladlen Koltun. 682-690 [doi]
• On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problemsNicole Immorlica, David R. Karger, Maria Minkoff, Vahab S. Mirrokni. 691-700 [doi]
• Frugality in path auctionsEdith Elkind, Amit Sahai, Kenneth Steiglitz. 701-709 [doi]
• An exact subexponential-time lattice algorithm for Asian optionsTian-Shyr Dai, Yuh-Dauh Lyuu. 710-717 [doi]
• Structural and algorithmic aspects of massive social networksStephen Eubank, V. S. Anil Kumar, Madhav V. Marathe, Aravind Srinivasan, Nan Wang. 718-727 [doi]
• A determinant-based algorithm for counting perfect matchings in a general graphSteve Chien. 728-735 [doi]
• On the number of rectangular partitionsEyal Ackerman, Gill Barequet, Ron Y. Pinter. 736-745 [doi]
• Computing equilibria for congestion games with (im)perfect informationRené Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking. 746-755 [doi]
• Efficiently decodable codes meeting Gilbert-Varshamov bound for low ratesVenkatesan Guruswami, Piotr Indyk. 756-757 [doi]
• Algorithms for infinite huffman-codesMordecai J. Golin, Kin-Keung Ma. 758-767 [doi]
• A certifying algorithm for the consecutive-ones propertyRoss M. McConnell. 768-777 [doi]
• Generic quantum Fourier transformsCristopher Moore, Daniel N. Rockmore, Alexander Russell. 778-787 [doi]
• Quasiconvex analysis of backtracking algorithmsDavid Eppstein. 788-797 [doi]
• Navigating nets: simple algorithms for proximity searchRobert Krauthgamer, James R. Lee. 798-807 [doi]
• Approximating the two-level facility location problem via a quasi-greedy approachJiawei Zhang. 808-817 [doi]
• A maiden analysis of Longest Wait FirstJeff Edmonds, Kirk Pruhs. 818-827 [doi]
• A deterministic near-linear time algorithm for finding minimum cuts in planar graphsParinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai. 828-829 [doi]
• Subexponential parameterized algorithms on graphs of bounded-genus and ::::H::::-minor-free graphsErik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos. 830-839 [doi]
• Equivalence of local treewidth and linear local treewidth and its algorithmic applicationsErik D. Demaine, Mohammad Taghi Hajiaghayi. 840-849 [doi]
• Hole and antihole detection in graphsStavros D. Nikolopoulos, Leonidas Palios. 850-859 [doi]
• Testing bipartiteness of geometric intersection graphsDavid Eppstein. 860-868 [doi]
• Finding dominators revisited: extended abstractLoukas Georgiadis, Robert Endre Tarjan. 869-878 [doi]
• How random is the human genome?Peter Winkler. 879 [doi]
• Complexities for generalized models of self-assemblyGagan Aggarwal, Michael H. Goldwasser, Ming-Yang Kao, Robert T. Schweller. 880-889 [doi]
• Invadable self-assembly: combining robustness with efficiencyHo-Lin Chen, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, Pablo Moisset de Espanés. 890-899 [doi]
• On contract-and-refine transformations between phylogenetic treesGaneshkumar Ganapathy, Vijaya Ramachandran, Tandy Warnow. 900-909 [doi]
• Reconstructing strings from random tracesTugkan Batu, Sampath Kannan, Sanjeev Khanna, Andrew McGregor. 910-918 [doi]
• Improved bounds on sorting with length-weighted reversalsMichael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan. 919-928 [doi]
• Point containment in the integer hull of a polyhedronErnst Althaus, Friedrich Eisenbrand, Stefan Funke, Kurt Mehlhorn. 929-933 [doi]
• Covering minimum spanning trees of random subgraphsMichel X. Goemans, Jan Vondrák. 934-941 [doi]
• A characterization of easily testable induced subgraphsNoga Alon, Asaf Shapira. 942-951 [doi]
• Bipartite roots of graphsLap Chi Lau. 952-961 [doi]
• Two tricks to triangulate chordal probe graphs in polynomial timeAnne Berry, Martin Charles Golumbic, Marina Lipshteyn. 962-969 [doi]
• Non-migratory online deadline scheduling on multiprocessorsHo-Leung Chan, Tak Wah Lam, Kar-Keung To. 970-979 [doi]
• The maximum latency of selfish routingTim Roughgarden. 980-981 [doi]
• Minimizing migrations in fair multiprocessor scheduling of persistent tasksTracy Kimbrel, Baruch Schieber, Maxim Sviridenko. 982-991 [doi]
• The wake-up problem in multi-hop radio networksMarek Chrobak, Leszek Gasieniec, Dariusz R. Kowalski. 992-1000 [doi]
• A fast approximation scheme for fractional covering problems with variable upper boundsLisa Fleischer. 1001-1010 [doi]
• On broadcasting in heterogenous networksSamir Khuller, Yoo Ah Kim. 1011-1020 [doi]
• End-to-end packet-scheduling in wireless ad-hoc networksV. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan. 1021-1030 [doi]
• Routing and scheduling in multihop wireless networks with time-varying channelsMatthew Andrews, Lisa Zhang. 1031-1040 [doi]
• Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differWilliam S. Evans, David G. Kirkpatrick. 1041-1049 [doi]
• Fair and efficient router congestion controlXiaojie Gao, Kamal Jain, Leonard J. Schulman. 1050-1059 [doi]
• Randomized pursuit-evasion with limited visibilityVolkan Isler, Sampath Kannan, Sanjeev Khanna. 1060-1069 [doi]
• Fault-tolerant gathering algorithms for autonomous mobile robotsNoa Agmon, David Peleg. 1070-1078 [doi]
• Approximate classification via earthmover metricsAaron Archer, Jittat Fakcharoenphol, Chris Harrelson, Robert Krauthgamer, Kunal Talwar, Éva Tardos. 1079-1087 [doi]
• Facility location with Service Installation CostsDavid B. Shmoys, Chaitanya Swamy, Retsef Levi. 1088-1097 [doi]
• On finding a guard that sees most and a shop that sells mostOtfried Cheong, Alon Efrat, Sariel Har-Peled. 1098-1107 [doi]
• On the diameter of the symmetric group: polynomial boundsLászló Babai, Robert Beals, Ákos Seress. 1108-1112 [doi]
• The power of basis selection in fourier sampling: hidden subgroup problems in affine groupsCristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman. 1113-1122 [doi]
• Simultaneous diophantine approximation with excluded primesLászló Babai, Daniel Stefankovic. 1123-1129 [doi]
• Constructing finite field extensions with large order elementsQi Cheng. 1130-1131 [doi]
• Polynomial interpolation from multiplesJoachim von zur Gathen, Igor Shparlinski. 1132-1137 [doi]