Abstract is missing.
- Optimal time-space trade-offs for non-comparison-based sortingRasmus Pagh, Jakob Pagter. 9-18 [doi]
- Union-find with deletionsHaim Kaplan, Nira Shafrir, Robert Endre Tarjan. 19-28 [doi]
- A locality-preserving cache-oblivious dynamic dictionaryMichael A. Bender, Ziyang Duan, John Iacono, Jing Wu. 29-38 [doi]
- Cache oblivious search trees via binary trees of small heightGerth Stølting Brodal, Rolf Fagerberg, Riko Jacob. 39-48 [doi]
- An approximation algorithm for the group Steiner problemGuy Even, Guy Kortsarz. 49-58 [doi]
- On directed Steiner treesLeonid Zosin, Samir Khuller. 59-63 [doi]
- An 8/13-approximation algorithm for the asymmetric maximum TSPMarkus Bläser. 64-73 [doi]
- Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problemsBéla Csaba, Marek Karpinski, Piotr Krysta. 74-83 [doi]
- An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraphHarold N. Gabow. 84-93 [doi]
- Censorship resistant peer-to-peer content addressable networksAmos Fiat, Jared Saia. 94-103 [doi]
- Web caching with request reorderingTomás Feder, Rajeev Motwani, Rina Panigrahy, An Zhu. 104-105 [doi]
- Improved algorithms for the data placement problemSudipto Guha, Kamesh Munagala. 106-107 [doi]
- Temporary tasks assignment resolvedAmitai Armon, Yossi Azar, Leah Epstein, Oded Regev. 116-124 [doi]
- Delaunay triangulation programs on surface dataSunghee Choi, Nina Amenta. 135-136 [doi]
- Quality meshing with weighted Delaunay refinementSiu-Wing Cheng, Tamal K. Dey. 137-146 [doi]
- Linear-size approximate voronoi diagramsSunil Arya, Theocharis Malamatos. 147-155 [doi]
- Faster approximation schemes for fractional multicommodity flow problemsGeorge Karakostas. 166-173 [doi]
- Flows over time with load-dependent transit timesEkkehard Köhler, Martin Skutella. 174-183 [doi]
- Improved bounds for the unsplittable flow problemPetr Kolman, Christian Scheideler. 184-193 [doi]
- NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flowThomas Erlebach, Alexander Hall. 194-202 [doi]
- How unfair is optimal routing?Tim Roughgarden. 203-204 [doi]
- Approximation algorithms for grammar-based compressionEric Lehman, Abhi Shelat. 205-212 [doi]
- Improving table compression with combinatorial optimizationAdam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo. 213-222 [doi]
- Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bitsHsueh-I Lu. 223-224 [doi]
- Succinct representations of lcp information and improvements in the compressed suffix arraysKunihiko Sadakane. 225-232 [doi]
- Succinct indexable dictionaries with applications to encoding k-ary trees and multisetsRajeev Raman, Venkatesh Raman, S. Srinivasa Rao. 233-242 [doi]
- JengaUri Zwick. 243-246 [doi]
- Guessing secrets with inner product questionsFan R. K. Chung, Ronald L. Graham, Linyuan Lu. 247-253 [doi]
- Guessing secrets efficiently via list decodingNoga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan. 254-262 [doi]
- How to cut a cake almost fairlySven Oliver Krumke, Maarten Lipmann, Willem de Paepe, Diana Poensgen, Jörg Rambau, Leen Stougie, Gerhard J. Woeginger. 263-264 [doi]
- The mathematics of playing golfGiovanni Rinaldi, Ulrich Voigt, Gerhard J. Woeginger. 265-266 [doi]
- Computing shortest paths with comparisons and additionsSeth Pettie, Vijaya Ramachandran. 267-276 [doi]
- An optimal algorithm for checking regularity (extended abstract)Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma. 277-286 [doi]
- Edge dominating and hypomatchable setsOjas Parekh. 287-291 [doi]
- An algorithm for counting maximum weighted independent sets and its applicationsVilhelm Dahllöf, Peter Jonsson. 292-298 [doi]
- Balls and bins models with feedbackEleni Drinea, Alan M. Frieze, Michael Mitzenmacher. 308-315 [doi]
- A note on random 2-SAT with prescribed literal degreesColin Cooper, Alan M. Frieze, Gregory B. Sorkin. 316-320 [doi]
- Mixing time and long paths in graphsIgor Pak. 321-328 [doi]
- The diameter of a long range percolation graphDon Coppersmith, David Gamarnik, Maxim Sviridenko. 329-337 [doi]
- Is the internet fractal?Cedric Adjih, Leonidas Georgiadis, Philippe Jacquet, Wojciech Szpankowski. 338-345 [doi]
- Center and diameter problems in plane triangulations and quadrangulationsVictor Chepoi, Feodor F. Dragan, Yann Vaxès. 346-355 [doi]
- Symmetric drawings of triconnected planar graphsSeok-Hee Hong, Brendan D. McKay, Peter Eades. 356-365 [doi]
- I/O-optimal algorithms for planar graphs using separatorsAnil Maheshwari, Norbert Zeh. 372-381 [doi]
- Polynomial time recognition of P4-structureRyan B. Hayward, Stefan Hougardy, Bruce A. Reed. 382-389 [doi]
- Adaptive intersection and t-threshold problemsJérémy Barbay, Claire Kenyon. 390-399 [doi]
- Separable attributes: a technique for solving the sub matrices character count problemAmihood Amir, Kenneth Ward Church, Emanuel Dar. 400-401 [doi]
- Generating random factored numbers, easilyAdam Kalai. 412-412 [doi]
- Tight bounds for worst-case equilibriaArtur Czumaj, Berthold Vöcking. 413-420 [doi]
- Broadcast scheduling: when fairness is fineJeff Edmonds, Kirk Pruhs. 421-430 [doi]
- Harmonic broadcasting is optimalLars Engebretsen, Madhu Sudan. 431-432 [doi]
- Windows scheduling problems for broadcast systemsAmotz Bar-Noy, Richard E. Ladner. 433-442 [doi]
- Scheduling protocols for switches with large envelopesMatthew Andrews, Lisa Zhang. 443-452 [doi]
- Covering shapes by ellipsesAlon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk. 453-454 [doi]
- Binary space partitions for line segments with a limited number of directionsCsaba D. Tóth. 465-471 [doi]
- Closest-point problems simplified on the RAMTimothy M. Chan. 472-473 [doi]
- Semi-online maintenance of geometric optima and measuresTimothy M. Chan. 474-483 [doi]
- Generalized clusteringSudipto Guha, Kamesh Munagala. 484-485 [doi]
- New bounds for multi-dimensional packingSteven S. Seiden, Rob van Stee. 486-495 [doi]
- Computer assisted proof of optimal approximability resultsUri Zwick. 496-505 [doi]
- MAX CUT in cubic graphsEran Halperin, Dror Livnat, Uri Zwick. 506-513 [doi]
- Approximating minimum unsatisfiability of linear equationsPiotr Berman, Marek Karpinski. 514-516 [doi]
- On-line algorithms for the dynamic traveling repair problemSandy Irani, Xiangwen Lu, Amelia Regan. 517-524 [doi]
- Competitive on-line switching policiesAmotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor. 525-534 [doi]
- A randomized online algorithm for bandwidth utilizationSanjeev Arora, Bo Brinkman. 535-539 [doi]
- Caching with expiration timesParikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi. 540-547 [doi]
- On-line scheduling of a single machine to minimize total weighted completion timeEdward J. Anderson, Chris N. Potts. 548-557 [doi]
- Hardware-assisted computation of depth contoursShankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian. 558-567 [doi]
- The wake up and report problem is time-equivalent to the firing squad synchronization problemDarin Goldstein, Nick Meyer. 578-587 [doi]
- Tree exploration with little memoryKrzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, Andrzej Pelc. 588-597 [doi]
- Efficient proper 2-coloring of almost disjoint hypergraphsJózsef Beck, Sachin Lodha. 598-605 [doi]
- Experimental analysis of simple, distributed vertex coloring algorithmsIrene Finocchi, Alessandro Panconesi, Riccardo Silvestri. 606-615 [doi]
- On semidefinite programming relaxations for graph coloring and vertex coverMoses Charikar. 616-620 [doi]
- Approximating k-cuts via network strengthR. Ravi, Amitabh Sinha II. 621-622 [doi]
- Reductions in streaming algorithms, with an application to counting triangles in graphsZiv Bar-Yossef, Ravi Kumar, D. Sivakumar. 623-632 [doi]
- Sampling from a moving window over streaming dataBrian Babcock, Mayur Datar, Rajeev Motwani. 633-634 [doi]
- Maintaining stream statistics over sliding windows (extended abstract)Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani. 635-644 [doi]
- Testing satisfiabilityNoga Alon, Asaf Shapira. 645-654 [doi]
- Efficient pattern-matching with don t caresAdam Kalai. 655-656 [doi]
- Efficient algorithms for document retrieval problemsS. Muthukrishnan. 657-666 [doi]
- The string edit distance matching problem with movesGraham Cormode, S. Muthukrishnan. 667-676 [doi]
- Expansion of product replacement graphsAlexander Gamburd, Igor Pak. 691-696 [doi]
- Explicit constructions of selectors and related combinatorial structures, with applicationsPiotr Indyk. 697-704 [doi]
- Derandomized dimensionality reduction with applicationsLars Engebretsen, Piotr Indyk, Ryan O Donnell. 705-712 [doi]
- Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithmsSeth Pettie, Vijaya Ramachandran. 713-722 [doi]
- Existence theorems, lower bounds and algorithms for scheduling to meet two objectivesApril Rasala, Clifford Stein, Eric Torng, Patchrawat Uthaisombut. 723-731 [doi]
- Scheduling split intervalsReuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira. 732-741 [doi]
- Shape dimension and approximation from samplesTamal K. Dey, Joachim Giesen, Samrat Goswami, Wulue Zhao. 772-780 [doi]
- Smooth-surface reconstruction in near-linear timeStefan Funke, Edgar A. Ramos. 781-790 [doi]
- Computing the writhing number of a polygonal knotPankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang. 791-799 [doi]
- On the overlay of envelopes in four dimensionsVladlen Koltun, Micha Sharir. 810-819 [doi]
- Preprocessing an undirected planar network to enable fast approximate distance queriesPhilip N. Klein. 820-827 [doi]
- Approximate distance oracles for geometric graphsJoachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid. 828-837 [doi]
- Oracles for distances avoiding a link-failureCamil Demetrescu, Mikkel Thorup. 838-843 [doi]
- Roundtrip spanners and roundtrip routing in directed graphsLiam Roditty, Mikkel Thorup, Uri Zwick. 844-851 [doi]
- Light spanners and approximate TSP in weighted graphs with forbidden minorsMichelangelo Grigni, Papa Sissokho. 852-857 [doi]
- Capacitated vertex covering with applicationsSudipto Guha, Refael Hassin, Samir Khuller, Einat Or. 858-865 [doi]
- Construction of probe interval modelsRoss M. McConnell, Jeremy Spinrad. 866-875 [doi]
- A new algorithm for protein folding in the HP modelAlantha Newman. 876-884 [doi]
- An optimal (expected time) algorithm for minimizing lab costs in DNA sequencingDavid Hart. 885-893 [doi]
- Approximating minimum quartet inconsistency (abstract)Gianluca Della Vedova, Tao Jiang, Jing Li 0002, Jianjun Wen. 894-895 [doi]
- Matrix rounding under the Lp-discrepancy measure and its application to digital halftoningTetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama. 896-904 [doi]
- Smoothed analysis of the perceptron algorithm for linear programmingAvrim Blum, John Dunagan. 905-914 [doi]
- A fully combinatorial algorithm for submodular function minimizationSatoru Iwata. 915-919 [doi]
- 0/1 optimization and 0/1 primal separation are equivalentFriedrich Eisenbrand, Giovanni Rinaldi, Paolo Ventura. 920-926 [doi]
- Labeling schemes for flow and connectivityMichal Katz, Nir A. Katz, Amos Korman, David Peleg. 927-936 [doi]
- Reachability and distance queries via 2-hop labelsEdith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick. 937-946 [doi]
- Improved labeling scheme for ancestor queriesStephen Alstrup, Theis Rauhe. 947-953 [doi]
- A comparison of labeling schemes for ancestor queriesHaim Kaplan, Tova Milo, Ronen Shabo. 954-963 [doi]
- Online algorithms for market clearingAvrim Blum, Tuomas Sandholm, Martin Zinkevich. 971-980 [doi]
- Frugal path mechanismsAaron Archer, Éva Tardos. 991-999 [doi]
- Erratum: an approximation algorithm for minimum-cost vertex-connectivity problemsR. Ravi, David P. Williamson. 1000-1001 [doi]