Table of Contents

• Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control AlgorithmsRan Adler, Yossi Azar. 1-10 [doi]
• I/O-Efficient Dynamic Point Location in Monotone Planar SubdivisionsPankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter. 11-20 [doi]
• Page Replacement for General Caching ProblemsSusanne Albers, Sanjeev Arora, Sanjeev Khanna. 31-40 [doi]
• A New Way to Use Semidefinite Programming with Applications to Linear Equations mod ::::p::::Gunnar Andersson, Lars Engebretsen, Johan Håstad. 41-50 [doi]
• A Practical Clustering Algorithm for Static and Dynamic Information OrganizationJaved A. Aslam, Katya Pelekhov, Daniela Rus. 51-60 [doi]
• Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer RegistersYonatan Aumann, Avivit Kapah-Levy. 61-70 [doi]
• Using Homogenous Weights for Approximating the Partial Cover ProblemReuven Bar-Yehuda. 71-75 [doi]
• A Lower Bound for Hellbronn s Triangle Problem in ::::d:::: DimensionsGill Barequet. 76-81 [doi]
• Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three DimensionsGill Barequet, Sariel Har-Peled. 82-91 [doi]
• Fast, Fair, and Frugal Bandwidth Allocation in ATM NetworksYair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang. 92-101 [doi]
• Kinetic Collision Detection Between Two Simple PolygonsJulien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang. 102-111 [doi]
• Locally Efficient On-Line Strategies for Routing Packets Along Fixed PathsPetra Berenbrink, Christian Scheideler. 112-121 [doi]
• Queries with Segments in Voronoi DiagramsSergei Bespamyatnikh, Jack Snoeyink. 122-129 [doi]
• Efficient Algorithms for Petersen s Matching TheoremTherese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw. 130-139 [doi]
• Stop Minding Your p s and q s: A Simplified ::::O::::(::::n::::) Planar Embedding AlgorithmJohn M. Boyer, Wendy J. Myrvold. 140-146 [doi]
• Fast Algorithms for Constructing Optimal Trees from QuartetsDavid Bryant, Mike A. Steel. 147-155 [doi]
• A Small Universal Graph for Bounded-degree Planar GraphsMichael R. Capalbo. 156-160 [doi]
• A Near-Linear Area Bound for Drawing Binary TreesTimothy M. Chan. 161-168 [doi]
• Greedy Local Improvement and Weighted Set Packing ApproximationBarun Chandra, Magnús M. Halldórsson. 169-176 [doi]
• Minimizing Wirelength in Zero and Bounded Skew Clock TreesMoses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins. 177-184 [doi]
• On Multi-Dimensional Packing ProblemsChandra Chekuri, Sanjeev Khanna. 185-194 [doi]
• Nonplanar Topological Inference and Political-Map GraphsZhi-Zhong Chen, Xin He, Ming-Yang Kao. 195-204 [doi]
• Approximate Minimum Weight Steiner Triangulation in Three DimensionsSiu-Wing Cheng, Tamal K. Dey. 205-214 [doi]
• Two-Point Euclidean Shortest Path Queries in the PlaneYi-Jen Chiang, Joseph S. B. Mitchell. 215-224 [doi]
• On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning TreesKa Wong Chong, Yijie Han, Tak Wah Lam. 225-234 [doi]
• Dynamic LCA Queries on TreesRichard Cole, Ramesh Hariharan. 235-244 [doi]
• Tree Pattern Matching and Subset Matching in Deterministic ::::O::::(::::n:::: log:::3::: ::::n::::)-timeRichard Cole, Ramesh Hariharan, Piotr Indyk. 245-254 [doi]
• Compact Routing with Minimum StretchLenore Cowen. 255-260 [doi]
• Recovering Evolutionary Trees Through Harmonic Greedy TripletsMiklós Csürös, Ming-Yang Kao. 261-270 [doi]
• Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic ProcessesArtur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys. 271-280 [doi]
• On Approximability of the Minimum-Cost ::::k::::-Connected Spanning Subgraph ProblemArtur Czumaj, Andrzej Lingas. 281-290 [doi]
• Clustering in Large Graphs and MatricesPetros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay. 291-299 [doi]
• Balanced Aspect Ratio Trees: Combining the Advantages of ::::k::::-d Trees and OctreesChristian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov. 300-309 [doi]
• Shortest Paths in an Arrangement with ::::k:::: Line OrientationsDavid Eppstein, David Hart. 310-316 [doi]
• Randomized Online Scheduling on Two Uniform MachinesLeah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger. 317-326 [doi]
• Separation-Sensitive Collision Detection for Convex ObjectsJeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang. 327-336 [doi]
• Optimal Construction of Edge-Disjoint Paths in Random Regular GraphsAlan M. Frieze, Lei Zhao. 346-355 [doi]
• How to Make a Square Grid Framework with Cables RigidHarold N. Gabow, Tibor Jordán. 356-365 [doi]
• Two-Dimensional Gantt Charts and a Scheduling Algorithm of LawlerMichel X. Goemans, David P. Williamson. 366-375 [doi]
• Cut Tree AlgorithmsPaul W. Goldberg, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk, Andrew V. Goldberg, Kostas Tsioutsiouliklis. 376-385 [doi]
• The Complexity of Gene PlacementLeslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk. 386-395 [doi]
• Patience is a Virtue: The Effect of Slack on Competitiveness for Admission ControlMichael H. Goldwasser. 396-405 [doi]
• Estimating Interpolation Error: A Combinatorial ApproachStephen Guattery, Gary L. Miller, Noel Walkington. 406-413 [doi]
• Fast Deterministic Construction of Static DictionariesTorben Hagerup. 414-418 [doi]
• Parallel Integer Sorting is More Efficient than Parallel Comparison Sorting on Exclusive Write PRAMsYijie Han, Xiaojun Shen. 419-428 [doi]
• New Algorithms for Generating Conway Polynomials Over Finite FieldsLenwood S. Heath, Nicholas A. Loehr. 429-437 [doi]
• A 1.598 Approximation Algorithm for the Steiner Problem in GraphsStefan Hougardy, Hans Jürgen Prömel. 448-453 [doi]
• A Small Approximately min-wise Independent Family of Hash FunctionsPiotr Indyk. 454-456 [doi]
• Geometric Matching Under Noise: Combinatorial Bounds and AlgorithmsPiotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian. 457-465 [doi]
• An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-SizeKazuo Iwama, Eiji Miyano. 466-475 [doi]
• Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial RelaxationSatoru Iwata. 476-483 [doi]
• A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity ProblemKamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson. 484-489 [doi]
• Linear-Time Approximation Schemes for Scheduling Malleable Parallel TasksKlaus Jansen, Lorant Porkolab. 490-498 [doi]
• Eliminating Migration in Multi-Processor SchedulingBala Kalyanasundaram, Kirk Pruhs. 499-506 [doi]
• On-line Complexity of Monotone Set SystemsHaim Kaplan, Mario Szegedy. 507-516 [doi]
• Parametric Polymatroid Optimization and Its Geometric ApplicationsNaoki Katoh, Hisao Tamaki, Takeshi Tokuyama. 517-526 [doi]
• Optimal On-line Algorithms for an Electronic Commerce Money Distribution SystemHiroshi Kawazoe, Tetsuo Shibuya, Takeshi Tokuyama. 527-536 [doi]
• Recovering Branches on the Tree of Life: An Approximation AlgorithmPaul E. Kearney, Ming Li, John Tsang, Tao Jiang. 537-546 [doi]
• The Data Broadcast Problem with Non-Uniform Transmission RimesClaire Kenyon, Nicolas Schabanel. 547-556 [doi]
• Wavelength Conversion in Optical NetworksJon M. Kleinberg, Amit Kumar. 566-575 [doi]
• Online Resource MinimizationAnton J. Kleywegt, Vijay S. Nori, Martin W. P. Savelsbergh, Craig A. Tovey. 576-585 [doi]
• Placement Algorithms for Hierarchical Cooperative CachingMadhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman. 586-595 [doi]
• Indexing Schemes for Random PointsElias Koutsoupias, David Scot Taylor. 596-602 [doi]
• Roundness Estimation via Random SamplingRavi Kumar, D. Sivakumar. 603-612 [doi]
• Cache Performance Analysis of Traversals and Random AccessesRichard E. Ladner, James D. Fix, Anthony LaMarca. 613-622 [doi]
• Trade-offs Between Speed and Processor in Hard-Deadline SchedulingTak Wah Lam, Kar-Keung To. 623-632 [doi]
• Distinguishing String Selection ProblemsJ. Kevin Lanctot, Ming Li, Bin Ma, Shaojiu Wang, Louxin Zhang. 633-642 [doi]
• New Algorithmic Aspects of the Local Lemma with Applications to Routing and PartitioningFrank Thomson Leighton, Satish Rao, Aravind Srinivasan. 643-652 [doi]
• Empirical Investigation of the Markov Reference ModelVincenzo Liberatore. 653-662 [doi]
• A Deterministic Approximation Algorithm for a Minmax Integer Programming ProblemChi-Jen Lu. 663-668 [doi]
• An Analysis of the Burrows-Wheeler TransformGiovanni Manzini. 669-677 [doi]
• Dual-Issue Scheduling with Spills for Binary TreesWaleed Meleis, Edward S. Davidson. 678-686 [doi]
• I/O-Complexity of Graph AlgorithmsKamesh Munagala, Abhiram G. Ranade. 687-694 [doi]
• All-to-All Optical Routing in Optimal Chordal Rings of Degree FourLata Narayanan, Jaroslav Opatrny, Dominique Sotteau. 695-703 [doi]
• Combinatorial Approximation Algorithms for Generalized Flow ProblemsJeffrey D. Oldham. 704-714 [doi]
• Certified Computation of the Sign of a Matrix DeterminantVictor Y. Pan, Yanqiang Yu. 715-724 [doi]
• Rendering Equation Revisited: How to Avoid Explicit Visibility ComputationsMarco Pellegrini. 725-733 [doi]
• Approximation Algorithms for the Asymmetric Postman ProblemBalaji Raghavachari, Jeyakesavan Veerasamy. 734-741 [doi]
• On the Bidirected Cut Relaxation for the Metric Steiner Tree ProblemSridhar Rajagopalan, Vijay V. Vazirani. 742-751 [doi]
• An Efficient Algorithm for Generating Necklaces with Fixed DensityJoe Sawada, Frank Ruskey. 752-758 [doi]
• Preemptive Scheduling with Job-Dependent Setup TimesPetra Schuurman, Gerhard J. Woeginger. 759-767 [doi]
• Median Bounds and Their ApplicationAlan Siegel. 776-785 [doi]
• Rectangular Tiling in Multi-dimensional ArraysAdam Smith, Subhash Suri. 786-794 [doi]
• A Generalization of Janson Inequalities and its Application to Finding Shortest PathsC. R. Subramanian. 795-804 [doi]
• Approximation Algorithms for Bipartite and Non-Bipartite Matching in the PlaneKasturi R. Varadarajan, Pankaj K. Agarwal. 805-814 [doi]
• A New Property and a Faster Algorithm for Baseball EliminationKevin D. Wayne. 815-819 [doi]
• When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS?Gerhard J. Woeginger. 820-829 [doi]
• Analysis of a Bounding Box Heuristic for Object IntersectionYunhong Zhou, Subhash Suri. 830-839 [doi]
• Inverse Inbreeding Coefficient Problems with an Application to Linkage Analysis of Recessive Diseases in Inbred PopulationsRicha Agarwala, Leslie G. Biesecker, Alejandro A. Schäffer. 840-841 [doi]
• Exploring Unknown Environments with ObstaclesSusanne Albers, Klaus Kursawe, Sven Schuierer. 842-843 [doi]
• Playing Twenty Questions with a ProcrastinatorAndris Ambainis, Stephen A. Bloch, David L. Schweizer. 844-845 [doi]
• Improved Bicriteria Existence Theorems for SchedulingJaved A. Aslam, April Rasala, Clifford Stein, Neal E. Young. 846-847 [doi]
• Group Signatures ::::Á la carte::::Giuseppe Ateniese, Gene Tsudik. 848-849 [doi]
• Computing Morse Functions on Triangulated ManifoldsUlrike Axen. 850-851 [doi]
• Algorithms for Total Weighted Completion Time SchedulingIvan D. Baev, Waleed Meleis, Alexandre E. Eichenberger. 852-853 [doi]
• Finding Maximum Independent Sets in Sparse and General GraphsRichard Beigel. 856-857 [doi]
• Optimal Multichannel Communication Under FailureTanya Y. Berger-Wolf, Edward M. Reingold. 858-859 [doi]
• A Wide-Range Efficient Algorithm for Minimal TriangulationAnne Berry. 860-861 [doi]
• Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hardGill Barequet, Sariel Har-Peled. 862-863 [doi]
• The Full Degree Spanning Tree ProblemRandeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann. 864-865 [doi]
• Locked and Unlocked Polygonal Chains in 3DTherese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. 866-867 [doi]
• A Formal Treatment of Remotely Keyed EncryptionMatt Blaze, Joan Feigenbaum, Moni Naor. 868-869 [doi]
• Unscrambling Address LinesAndrei Z. Broder, Michael Mitzenmacher, Laurent Moll. 870-871 [doi]
• Some Graphic Uses of an Even Number of Odd NodesKathie Cameron, Jack Edmonds. 872 [doi]
• Minimizing Weighted Completion Time on a Single MachineChandra Chekuri, Rajeev Motwani. 873-874 [doi]
• Improved Approximation Algorithms for a Capacitated Facility Location ProblemFabián A. Chudak, David B. Shmoys. 875-876 [doi]
• Fluid Limits, Bin Packing, and Stochastic Analysis of AlgorithmsEdward G. Coffman Jr., Alexander L. Stolyar. 877-878 [doi]
• LP-based Analysis of Greedy-dual-sizeEdith Cohen, Haim Kaplan. 879-880 [doi]
• Scheduling Calls for Multicasting in Tree-NetworksJohanne Cohen, Pierre Fraigniaud, Margarida Mitjana. 881-882 [doi]
• Compact Roundtrip Routing for DigraphsLenore Cowen, Christopher G. Wagner. 885-886 [doi]
• Parallel Virtual MemoryFrank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari. 889-890 [doi]
• Folding and One Straight Cut SufficeErik D. Demaine, Martin L. Demaine, Anna Lubiw. 891-892 [doi]
• A Simple Provable Algorithm for Curve ReconstructionTamal K. Dey, Piyush Kumar. 893-894 [doi]
• Existence of Multiplicative Secret Sharing Schemes with Polynomial Share ExpansionGiovanni Di Crescenzo, Yair Frankel. 895-896 [doi]
• The 2-Catalog Segmentation ProblemYevgeniy Dodis, Venkatesan Guruswami, Sanjeev Khanna. 897-898 [doi]
• Incremental and Decremental Maintenance of Planar WidthDavid Eppstein. 899-900 [doi]
• Checking Priority QueuesUlrich Finkler, Kurt Mehlhorn. 901-902 [doi]
• Randomized Splay TreesMartin Fürer. 903-904 [doi]
• Efficient Approximation Algorithms for the Hamming Center ProblemLeszek Gasieniec, Jesper Jansson, Andrzej Lingas. 905-906 [doi]
• Algorithms for Compile-Time Memory OptimizationJordan Gergov. 907-908 [doi]
• Synopsis Data Structures for Massive Data SetsPhillip B. Gibbons, Yossi Matias. 909-910 [doi]
• Stability of Networks and Protocols in the Adversarial Queueing Model for Packet RoutingAshish Goel. 911-912 [doi]
• Reconstructing Set PartitionsVladimir Grebinski, Gregory Kucherov. 915-916 [doi]
• Online Coloring Known GraphsMagnús M. Halldórsson. 917-918 [doi]
• Dynamical System Representation of Open Address Hash FunctionsGregory L. Heileman, Chaouki T. Abdallah, Bernard M. E. Moret, Bradley J. Smith. 919-920 [doi]
• Efficient Exact Sampling from the Ising Model Using Swendsen-WangMark Huber. 921-922 [doi]
• Fully Dynamic Algorithms for Chordal GraphsLouis Ibarra. 923-924 [doi]
• What are the Least Tractable Instances of max Tndependent Set?David S. Johnson, Mario Szegedy. 927-928 [doi]
• A Generalized ::::q:::::::th::: Root AlgorithmAnna M. Johnston. 929-930 [doi]
• Computing Nearest Neighbors for Moving Points and Applications to ClusteringTapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu. 931-932 [doi]
• Designing Proxies for Stock Market Indices is Computationally HardMing-Yang Kao, Stephen R. Tate. 933-934 [doi]
• Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing DataHaim Kaplan, Martin Strauss, Mario Szegedy. 935-936 [doi]
• A Uniform Framework for Approximating Weighted Connectivity ProblemsSamir Khuller, Balaji Raghavachari, An Zhu. 937-938 [doi]
• The Advantages of Forward Thinking in Generating Rooted and Free TreesGang Li, Frank Ruskey. 939-940 [doi]
• An Algorithm to Symbolically Describe Flows on SurfacesLuis-Miguel Lopez, Philippe Narbel. 941-942 [doi]
• On the Optimality of Parsing in Dynamic Dictionary Based Data CompressionYossi Matias, Süleyman Cenk Sahinalp. 943-944 [doi]
• Approximation Algorithms for Protein Folding PredictionGiancarlo Mauri, Giulio Pavesi, Antonio Piccolboni. 945-946 [doi]
• Compass Permits Leader ElectionJacques Mazoyer, Codrin M. Nichitiu, Eric Rémila. 947-948 [doi]
• Combinatorics Helps for Hexahedral Mesh Generation in CADMatthias Müller-Hannemann. 949-950 [doi]
• Approximating Multiroot 3-Outconnected SubgraphsZeev Nutov. 951-952 [doi]
• Using Stopping Times to Bound Mixing TimesIgor Pak. 953-954 [doi]
• Greedy Algorithms for Optimized DNA SequencingAllon G. Percus, David C. Torney. 955-956 [doi]
• Emulations Between QSM, BSP, and LogP: A Framework for General-Purpose Parallel Algorithm DesignVijaya Ramachandran, Brian Grayson, Michael Dahlin. 957-958 [doi]
• Sampling Spin Configurations of an Ising SystemDana Randall, David Wilson. 959-960 [doi]
• Approximability of Scheduling with Fixed JobsMark Scharbrodt, Angelika Steger, Horst Weisser. 961-962 [doi]
• Optimal Scheduling of Multiclass Parallel MachinesJay Sethuraman, Mark S. Squillante. 963-964 [doi]
• Colouring Graphs with Prescribed Induced Cycle LengthsIngo Schiermeyer, Bert Randerath. 965-966 [doi]
• An Oracle-Polynomial Time Augmentation Algorithm for Integer ProgrammingAndreas S. Schulz, Robert Weismantel. 967-968 [doi]
• Packet Filtering in High Speed NetworksSubhash Suri, George Varghese. 969-970 [doi]
• A Slique Size Bounding Technique with Application to Non-Linear CodesMario Szegedy. 971-972 [doi]
• Lower Bounds for SRPT-Subsequence Algorithms for Nonpreemptive SchedulingEric Torng, Patchrawat Uthaisombut. 973-974 [doi]
• A Convex Relaxation for the Asymmetric TSPSantosh Vempala, Mihalis Yannakakis. 975-976 [doi]
• Faster Approximation Algorithms for Generalized FlowKevin D. Wayne, Lisa Fleischer. 981-982 [doi]
• Experimental Performance of Shared RSA Modulus GenerationRebecca N. Wright, Sara Spalding. 983-984 [doi]
• Fast and Effective Stripification of Polygonal Surface ModelsXinyu Xiang, Martin Held, Joseph S. B. Mitchell. 985-986 [doi]