10. SODA 1999:
Baltimore,
Maryland,
USA
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms,
17-19 January 1999,
Baltimore,
Maryland. ACM/SIAM
- Ran Adler, Yossi Azar:
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms.
1-10
Electronic Edition (ACM DL) BibTeX
- Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter:
I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions.
11-20
Electronic Edition (ACM DL) BibTeX
- Pankaj K. Agarwal, Micha Sharir:
Motion Planning of a Ball Amid Segments in Three Dimensions.
21-30
Electronic Edition (ACM DL) BibTeX
- Susanne Albers, Sanjeev Arora, Sanjeev Khanna:
Page Replacement for General Caching Problems.
31-40
Electronic Edition (ACM DL) BibTeX
- Gunnar Andersson, Lars Engebretsen, Johan Håstad:
A New Way to Use Semidefinite Programming with Applications to Linear Equations mod p.
41-50
Electronic Edition (ACM DL) BibTeX
- Javed A. Aslam, Katya Pelekhov, Daniela Rus:
A Practical Clustering Algorithm for Static and Dynamic Information Organization.
51-60
Electronic Edition (ACM DL) BibTeX
- Yonatan Aumann, Avivit Kapah-Levy:
Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers.
61-70
Electronic Edition (ACM DL) BibTeX
- Reuven Bar-Yehuda:
Using Homogenous Weights for Approximating the Partial Cover Problem.
71-75
Electronic Edition (ACM DL) BibTeX
- Gill Barequet:
A Lower Bound for Hellbronn's Triangle Problem in d Dimensions.
76-81
Electronic Edition (ACM DL) BibTeX
- Gill Barequet, Sariel Har-Peled:
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions.
82-91
Electronic Edition (ACM DL) BibTeX
- Yair Bartal, Martin Farach-Colton, Shibu Yooseph, Lisa Zhang:
Fast, Fair, and Frugal Bandwidth Allocation in ATM Networks.
92-101
Electronic Edition (ACM DL) BibTeX
- Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger, Li Zhang:
Kinetic Collision Detection Between Two Simple Polygons.
102-111
Electronic Edition (ACM DL) BibTeX
- Petra Berenbrink, Christian Scheideler:
Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.
112-121
Electronic Edition (ACM DL) BibTeX
- Sergei Bespamyatnikh, Jack Snoeyink:
Queries with Segments in Voronoi Diagrams.
122-129
Electronic Edition (ACM DL) BibTeX
- Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw:
Efficient Algorithms for Petersen's Matching Theorem.
130-139
Electronic Edition (ACM DL) BibTeX
- John M. Boyer, Wendy J. Myrvold:
Stop Minding Your p's and q's: A Simplified O(n) Planar Embedding Algorithm.
140-146
Electronic Edition (ACM DL) BibTeX
- David Bryant, Mike A. Steel:
Fast Algorithms for Constructing Optimal Trees from Quartets.
147-155
Electronic Edition (ACM DL) BibTeX
- Michael R. Capalbo:
A Small Universal Graph for Bounded-degree Planar Graphs.
156-160
Electronic Edition (ACM DL) BibTeX
- Timothy M. Chan:
A Near-Linear Area Bound for Drawing Binary Trees.
161-168
Electronic Edition (ACM DL) BibTeX
- Barun Chandra, Magnús M. Halldórsson:
Greedy Local Improvement and Weighted Set Packing Approximation.
169-176
Electronic Edition (ACM DL) BibTeX
- Moses Charikar, Jon M. Kleinberg, Ravi Kumar, Sridhar Rajagopalan, Amit Sahai, Andrew Tomkins:
Minimizing Wirelength in Zero and Bounded Skew Clock Trees.
177-184
Electronic Edition (ACM DL) BibTeX
- Chandra Chekuri, Sanjeev Khanna:
On Multi-Dimensional Packing Problems.
185-194
Electronic Edition (ACM DL) BibTeX
- Zhi-Zhong Chen, Xin He, Ming-Yang Kao:
Nonplanar Topological Inference and Political-Map Graphs.
195-204
Electronic Edition (ACM DL) BibTeX
- Siu-Wing Cheng, Tamal K. Dey:
Approximate Minimum Weight Steiner Triangulation in Three Dimensions.
205-214
Electronic Edition (ACM DL) BibTeX
- Yi-Jen Chiang, Joseph S. B. Mitchell:
Two-Point Euclidean Shortest Path Queries in the Plane.
215-224
Electronic Edition (ACM DL) BibTeX
- Ka Wong Chong, Yijie Han, Tak Wah Lam:
On the Parallel Time Complexity of Undirected Connectivity and Minimum Spanning Trees.
225-234
Electronic Edition (ACM DL) BibTeX
- Richard Cole, Ramesh Hariharan:
Dynamic LCA Queries on Trees.
235-244
Electronic Edition (ACM DL) BibTeX
- Richard Cole, Ramesh Hariharan, Piotr Indyk:
Tree Pattern Matching and Subset Matching in Deterministic O(n log3 n)-time.
245-254
Electronic Edition (ACM DL) BibTeX
- Lenore Cowen:
Compact Routing with Minimum Stretch.
255-260
Electronic Edition (ACM DL) BibTeX
- Miklós Csürös, Ming-Yang Kao:
Recovering Evolutionary Trees Through Harmonic Greedy Triplets.
261-270
Electronic Edition (ACM DL) BibTeX
- Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys:
Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes.
271-280
Electronic Edition (ACM DL) BibTeX
- Artur Czumaj, Andrzej Lingas:
On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem.
281-290
Electronic Edition (ACM DL) BibTeX
- Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay:
Clustering in Large Graphs and Matrices.
291-299
Electronic Edition (ACM DL) BibTeX
- Christian A. Duncan, Michael T. Goodrich, Stephen G. Kobourov:
Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees.
300-309
Electronic Edition (ACM DL) BibTeX
- David Eppstein, David Hart:
Shortest Paths in an Arrangement with k Line Orientations.
310-316
Electronic Edition (ACM DL) BibTeX
- Leah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger:
Randomized Online Scheduling on Two Uniform Machines.
317-326
Electronic Edition (ACM DL) BibTeX
- Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang:
Separation-Sensitive Collision Detection for Convex Objects.
327-336
Electronic Edition (ACM DL) BibTeX
- Sándor P. Fekete:
Simplicity and Hardness of the Maximum Traveling Salesman Problem Under Geometric Distances.
337-345
Electronic Edition (ACM DL) BibTeX
- Alan M. Frieze, Lei Zhao:
Optimal Construction of Edge-Disjoint Paths in Random Regular Graphs.
346-355
Electronic Edition (ACM DL) BibTeX
- Harold N. Gabow, Tibor Jordán:
How to Make a Square Grid Framework with Cables Rigid.
356-365
Electronic Edition (ACM DL) BibTeX
- Michel X. Goemans, David P. Williamson:
Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler.
366-375
Electronic Edition (ACM DL) BibTeX
- Andrew V. Goldberg, Paul W. Goldberg, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk, Andrew V. Goldberg, Kostas Tsioutsiouliklis:
Cut Tree Algorithms.
376-385
Electronic Edition (ACM DL) BibTeX
- Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson, Pavel A. Pevzner, Süleyman Cenk Sahinalp, Elizabeth Sweedyk:
The Complexity of Gene Placement.
386-395
Electronic Edition (ACM DL) BibTeX
- Michael H. Goldwasser:
Patience is a Virtue: The Effect of Slack on Competitiveness for Admission Control.
396-405
Electronic Edition (ACM DL) BibTeX
- Stephen Guattery, Gary L. Miller, Noel Walkington:
Estimating Interpolation Error: A Combinatorial Approach.
406-413
Electronic Edition (ACM DL) BibTeX
- Torben Hagerup:
Fast Deterministic Construction of Static Dictionaries.
414-418
Electronic Edition (ACM DL) BibTeX
- Yijie Han, Xiaojun Shen:
Parallel Integer Sorting is More Efficient than Parallel Comparison Sorting on Exclusive Write PRAMs.
419-428
Electronic Edition (ACM DL) BibTeX
- Lenwood S. Heath, Nicholas A. Loehr:
New Algorithms for Generating Conway Polynomials Over Finite Fields.
429-437
Electronic Edition (ACM DL) BibTeX
- Monika Rauch Henzinger, Stefano Leonardi:
Scheduling Multicasts on Unit-Capacity Trees and Meshes.
438-447
Electronic Edition (ACM DL) BibTeX
- Stefan Hougardy, Hans Jürgen Prömel:
A 1.598 Approximation Algorithm for the Steiner Problem in Graphs.
448-453
Electronic Edition (ACM DL) BibTeX
- Piotr Indyk:
A Small Approximately min-wise Independent Family of Hash Functions.
454-456
Electronic Edition (ACM DL) BibTeX
- Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian:
Geometric Matching Under Noise: Combinatorial Bounds and Algorithms.
457-465
Electronic Edition (ACM DL) BibTeX
- Kazuo Iwama, Eiji Miyano:
An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size.
466-475
Electronic Edition (ACM DL) BibTeX
- Satoru Iwata:
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation.
476-483
Electronic Edition (ACM DL) BibTeX
- Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson:
A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem.
484-489
Electronic Edition (ACM DL) BibTeX
- Klaus Jansen, Lorant Porkolab:
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks.
490-498
Electronic Edition (ACM DL) BibTeX
- Bala Kalyanasundaram, Kirk Pruhs:
Eliminating Migration in Multi-Processor Scheduling.
499-506
Electronic Edition (ACM DL) BibTeX
- Haim Kaplan, Mario Szegedy:
On-line Complexity of Monotone Set Systems.
507-516
Electronic Edition (ACM DL) BibTeX
- Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
Parametric Polymatroid Optimization and Its Geometric Applications.
517-526
Electronic Edition (ACM DL) BibTeX
- Hiroshi Kawazoe, Tetsuo Shibuya, Takeshi Tokuyama:
Optimal On-line Algorithms for an Electronic Commerce Money Distribution System.
527-536
Electronic Edition (ACM DL) BibTeX
- Paul E. Kearney, Ming Li, John Tsang, Tao Jiang:
Recovering Branches on the Tree of Life: An Approximation Algorithm.
537-546
Electronic Edition (ACM DL) BibTeX
- Claire Kenyon, Nicolas Schabanel:
The Data Broadcast Problem with Non-Uniform Transmission Rimes.
547-556
Electronic Edition (ACM DL) BibTeX
- Tracy Kimbrel:
Interleaved Prefetching.
557-565
Electronic Edition (ACM DL) BibTeX
- Jon M. Kleinberg, Amit Kumar:
Wavelength Conversion in Optical Networks.
566-575
Electronic Edition (ACM DL) BibTeX
- Anton J. Kleywegt, Vijay S. Nori, Martin W. P. Savelsbergh, Craig A. Tovey:
Online Resource Minimization.
576-585
Electronic Edition (ACM DL) BibTeX
- Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman:
Placement Algorithms for Hierarchical Cooperative Caching.
586-595
Electronic Edition (ACM DL) BibTeX
- Elias Koutsoupias, David Scot Taylor:
Indexing Schemes for Random Points.
596-602
Electronic Edition (ACM DL) BibTeX
- Ravi Kumar, D. Sivakumar:
Roundness Estimation via Random Sampling.
603-612
Electronic Edition (ACM DL) BibTeX
- Richard E. Ladner, James D. Fix, Anthony LaMarca:
Cache Performance Analysis of Traversals and Random Accesses.
613-622
Electronic Edition (ACM DL) BibTeX
- Tak Wah Lam, Kar-Keung To:
Trade-offs Between Speed and Processor in Hard-Deadline Scheduling.
623-632
Electronic Edition (ACM DL) BibTeX
- J. Kevin Lanctot, Ming Li, Bin Ma, Shaojiu Wang, Louxin Zhang:
Distinguishing String Selection Problems.
633-642
Electronic Edition (ACM DL) BibTeX
- Frank Thomson Leighton, Satish Rao, Aravind Srinivasan:
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.
643-652
Electronic Edition (ACM DL) BibTeX
- Vincenzo Liberatore:
Empirical Investigation of the Markov Reference Model.
653-662
Electronic Edition (ACM DL) BibTeX
- Chi-Jen Lu:
A Deterministic Approximation Algorithm for a Minmax Integer Programming Problem.
663-668
Electronic Edition (ACM DL) BibTeX
- Giovanni Manzini:
An Analysis of the Burrows-Wheeler Transform.
669-677
Electronic Edition (ACM DL) BibTeX
- Waleed Meleis, Edward S. Davidson:
Dual-Issue Scheduling with Spills for Binary Trees.
678-686
Electronic Edition (ACM DL) BibTeX
- Kamesh Munagala, Abhiram G. Ranade:
I/O-Complexity of Graph Algorithms.
687-694
Electronic Edition (ACM DL) BibTeX
- Lata Narayanan, Jaroslav Opatrny, Dominique Sotteau:
All-to-All Optical Routing in Optimal Chordal Rings of Degree Four.
695-703
Electronic Edition (ACM DL) BibTeX
- Jeffrey D. Oldham:
Combinatorial Approximation Algorithms for Generalized Flow Problems.
704-714
Electronic Edition (ACM DL) BibTeX
- Victor Y. Pan, Yanqiang Yu:
Certified Computation of the Sign of a Matrix Determinant.
715-724
Electronic Edition (ACM DL) BibTeX
- Marco Pellegrini:
Rendering Equation Revisited: How to Avoid Explicit Visibility Computations.
725-733
Electronic Edition (ACM DL) BibTeX
- Balaji Raghavachari, Jeyakesavan Veerasamy:
Approximation Algorithms for the Asymmetric Postman Problem.
734-741
Electronic Edition (ACM DL) BibTeX
- Sridhar Rajagopalan, Vijay V. Vazirani:
On the Bidirected Cut Relaxation for the Metric Steiner Tree Problem.
742-751
Electronic Edition (ACM DL) BibTeX
- Joe Sawada, Frank Ruskey:
An Efficient Algorithm for Generating Necklaces with Fixed Density.
752-758
Electronic Edition (ACM DL) BibTeX
- Petra Schuurman, Gerhard J. Woeginger:
Preemptive Scheduling with Job-Dependent Setup Times.
759-767
Electronic Edition (ACM DL) BibTeX
- Jeffrey Shallit, David Swart:
An Efficient Algorithm for Computing the ith letter of 4na.
768-775
Electronic Edition (ACM DL) BibTeX
- Alan Siegel:
Median Bounds and Their Application.
776-785
Electronic Edition (ACM DL) BibTeX
- Adam Smith, Subhash Suri:
Rectangular Tiling in Multi-dimensional Arrays.
786-794
Electronic Edition (ACM DL) BibTeX
- C. R. Subramanian:
A Generalization of Janson Inequalities and its Application to Finding Shortest Paths.
795-804
Electronic Edition (ACM DL) BibTeX
- Kasturi R. Varadarajan, Pankaj K. Agarwal:
Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane.
805-814
Electronic Edition (ACM DL) BibTeX
- Kevin D. Wayne:
A New Property and a Faster Algorithm for Baseball Elimination.
815-819
Electronic Edition (ACM DL) BibTeX
- Gerhard J. Woeginger:
When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS?
820-829
Electronic Edition (ACM DL) BibTeX
- Yunhong Zhou, Subhash Suri:
Analysis of a Bounding Box Heuristic for Object Intersection.
830-839
Electronic Edition (ACM DL) BibTeX
- Richa Agarwala, Leslie G. Biesecker, Alejandro A. Schäffer:
Inverse Inbreeding Coefficient Problems with an Application to Linkage Analysis of Recessive Diseases in Inbred Populations.
840-841
Electronic Edition (ACM DL) BibTeX
- Susanne Albers, Klaus Kursawe, Sven Schuierer:
Exploring Unknown Environments with Obstacles.
842-843
Electronic Edition (ACM DL) BibTeX
- Andris Ambainis, Stephen A. Bloch, David L. Schweizer:
Playing Twenty Questions with a Procrastinator.
844-845
Electronic Edition (ACM DL) BibTeX
- Javed A. Aslam, April Rasala, Clifford Stein, Neal E. Young:
Improved Bicriteria Existence Theorems for Scheduling.
846-847
Electronic Edition (ACM DL) BibTeX
- Giuseppe Ateniese, Gene Tsudik:
Group Signatures Á la carte.
848-849
Electronic Edition (ACM DL) BibTeX
- Ulrike Axen:
Computing Morse Functions on Triangulated Manifolds.
850-851
Electronic Edition (ACM DL) BibTeX
- Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger:
Algorithms for Total Weighted Completion Time Scheduling.
852-853
Electronic Edition (ACM DL) BibTeX
- Brenda S. Baker:
Parameterized diff.
854-855
Electronic Edition (ACM DL) BibTeX
- Richard Beigel:
Finding Maximum Independent Sets in Sparse and General Graphs.
856-857
Electronic Edition (ACM DL) BibTeX
- Tanya Y. Berger-Wolf, Edward M. Reingold:
Optimal Multichannel Communication Under Failure.
858-859
Electronic Edition (ACM DL) BibTeX
- Anne Berry:
A Wide-Range Efficient Algorithm for Minimal Triangulation.
860-861
Electronic Edition (ACM DL) BibTeX
- Gill Barequet, Sariel Har-Peled:
Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard.
862-863
Electronic Edition (ACM DL) BibTeX
- Randeep Bhatia, Samir Khuller, Robert Pless, Yoram J. Sussmann:
The Full Degree Spanning Tree Problem.
864-865
Electronic Edition (ACM DL) BibTeX
- Therese 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:
Locked and Unlocked Polygonal Chains in 3D.
866-867
Electronic Edition (ACM DL) BibTeX
- Matt Blaze, Joan Feigenbaum, Moni Naor:
A Formal Treatment of Remotely Keyed Encryption.
868-869
Electronic Edition (ACM DL) BibTeX
- Andrei Z. Broder, Michael Mitzenmacher, Laurent Moll:
Unscrambling Address Lines.
870-871
Electronic Edition (ACM DL) BibTeX
- Kathie Cameron, Jack Edmonds:
Some Graphic Uses of an Even Number of Odd Nodes.
872
Electronic Edition (ACM DL) BibTeX
- Chandra Chekuri, Rajeev Motwani:
Minimizing Weighted Completion Time on a Single Machine.
873-874
Electronic Edition (ACM DL) BibTeX
- Fabián A. Chudak, David B. Shmoys:
Improved Approximation Algorithms for a Capacitated Facility Location Problem.
875-876
Electronic Edition (ACM DL) BibTeX
- Edward G. Coffman Jr., Alexander L. Stolyar:
Fluid Limits, Bin Packing, and Stochastic Analysis of Algorithms.
877-878
Electronic Edition (ACM DL) BibTeX
- Edith Cohen, Haim Kaplan:
LP-based Analysis of Greedy-dual-size.
879-880
Electronic Edition (ACM DL) BibTeX
- Johanne Cohen, Pierre Fraigniaud, Margarida Mitjana:
Scheduling Calls for Multicasting in Tree-Networks.
881-882
Electronic Edition (ACM DL) BibTeX
- Derek G. Corneil, Stephan Olariu, Lorna Stewart:
LBFS Orderings and Cocomparability Graphs.
883-884
Electronic Edition (ACM DL) BibTeX
- Lenore Cowen, Christopher G. Wagner:
Compact Roundtrip Routing for Digraphs.
885-886
Electronic Edition (ACM DL) BibTeX
- Celina M. Herrera de Figueiredo, Luerbio Faria, Candido Ferreira Xavier de Mendonça Neto:
Optimal Node-Degree Bounds for the Complexity of Nonplanarity Parameters.
887-888
Electronic Edition (ACM DL) BibTeX
- Frank K. H. A. Dehne, Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
Parallel Virtual Memory.
889-890
Electronic Edition (ACM DL) BibTeX
- Erik D. Demaine, Martin L. Demaine, Anna Lubiw:
Folding and One Straight Cut Suffice.
891-892
Electronic Edition (ACM DL) BibTeX
- Tamal K. Dey, Piyush Kumar:
A Simple Provable Algorithm for Curve Reconstruction.
893-894
Electronic Edition (ACM DL) BibTeX
- Giovanni Di Crescenzo, Yair Frankel:
Existence of Multiplicative Secret Sharing Schemes with Polynomial Share Expansion.
895-896
Electronic Edition (ACM DL) BibTeX
- Yevgeniy Dodis, Venkatesan Guruswami, Sanjeev Khanna:
The 2-Catalog Segmentation Problem.
897-898
Electronic Edition (ACM DL) BibTeX
- David Eppstein:
Incremental and Decremental Maintenance of Planar Width.
899-900
Electronic Edition (ACM DL) BibTeX
- Ulrich Finkler, Kurt Mehlhorn:
Checking Priority Queues.
901-902
Electronic Edition (ACM DL) BibTeX
- Martin Fürer:
Randomized Splay Trees.
903-904
Electronic Edition (ACM DL) BibTeX
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
Efficient Approximation Algorithms for the Hamming Center Problem.
905-906
Electronic Edition (ACM DL) BibTeX
- Jordan Gergov:
Algorithms for Compile-Time Memory Optimization.
907-908
Electronic Edition (ACM DL) BibTeX
- Phillip B. Gibbons, Yossi Matias:
Synopsis Data Structures for Massive Data Sets.
909-910
Electronic Edition (ACM DL) BibTeX
- Ashish Goel:
Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing.
911-912
Electronic Edition (ACM DL) BibTeX
- Andrew V. Goldberg, Bernard M. E. Moret:
Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research.
913-914
Electronic Edition (ACM DL) BibTeX
- Vladimir Grebinski, Gregory Kucherov:
Reconstructing Set Partitions.
915-916
Electronic Edition (ACM DL) BibTeX
- Magnús M. Halldórsson:
Online Coloring Known Graphs.
917-918
Electronic Edition (ACM DL) BibTeX
- Gregory L. Heileman, Chaouki T. Abdallah, Bernard M. E. Moret, Bradley J. Smith:
Dynamical System Representation of Open Address Hash Functions.
919-920
Electronic Edition (ACM DL) BibTeX
- Mark Huber:
Efficient Exact Sampling from the Ising Model Using Swendsen-Wang.
921-922
Electronic Edition (ACM DL) BibTeX
- Louis Ibarra:
Fully Dynamic Algorithms for Chordal Graphs.
923-924
Electronic Edition (ACM DL) BibTeX
- Gabriel Istrate:
The Phase Transition in Random Horn Satisfiability and Its Algorithmic Implications.
925-926
Electronic Edition (ACM DL) BibTeX
- David S. Johnson, Mario Szegedy:
What are the Least Tractable Instances of max Tndependent Set?
927-928
Electronic Edition (ACM DL) BibTeX
- Anna M. Johnston:
A Generalized qth Root Algorithm.
929-930
Electronic Edition (ACM DL) BibTeX
- Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu:
Computing Nearest Neighbors for Moving Points and Applications to Clustering.
931-932
Electronic Edition (ACM DL) BibTeX
- Ming-Yang Kao, Stephen R. Tate:
Designing Proxies for Stock Market Indices is Computationally Hard.
933-934
Electronic Edition (ACM DL) BibTeX
- Haim Kaplan, Martin Strauss, Mario Szegedy:
Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data.
935-936
Electronic Edition (ACM DL) BibTeX
- Samir Khuller, Balaji Raghavachari, An Zhu:
A Uniform Framework for Approximating Weighted Connectivity Problems.
937-938
Electronic Edition (ACM DL) BibTeX
- Gang Li, Frank Ruskey:
The Advantages of Forward Thinking in Generating Rooted and Free Trees.
939-940
Electronic Edition (ACM DL) BibTeX
- Luis-Miguel Lopez, Philippe Narbel:
An Algorithm to Symbolically Describe Flows on Surfaces.
941-942
Electronic Edition (ACM DL) BibTeX
- Yossi Matias, Süleyman Cenk Sahinalp:
On the Optimality of Parsing in Dynamic Dictionary Based Data Compression.
943-944
Electronic Edition (ACM DL) BibTeX
- Giancarlo Mauri, Giulio Pavesi, Antonio Piccolboni:
Approximation Algorithms for Protein Folding Prediction.
945-946
Electronic Edition (ACM DL) BibTeX
- Jacques Mazoyer, Codrin M. Nichitiu, Eric Rémila:
Compass Permits Leader Election.
947-948
Electronic Edition (ACM DL) BibTeX
- Matthias Müller-Hannemann:
Combinatorics Helps for Hexahedral Mesh Generation in CAD.
949-950
Electronic Edition (ACM DL) BibTeX
- Zeev Nutov:
Approximating Multiroot 3-Outconnected Subgraphs.
951-952
Electronic Edition (ACM DL) BibTeX
- Igor Pak:
Using Stopping Times to Bound Mixing Times.
953-954
Electronic Edition (ACM DL) BibTeX
- Allon G. Percus, David C. Torney:
Greedy Algorithms for Optimized DNA Sequencing.
955-956
Electronic Edition (ACM DL) BibTeX
- Vijaya Ramachandran, Brian Grayson, Michael Dahlin:
Emulations Between QSM, BSP, and LogP: A Framework for General-Purpose Parallel Algorithm Design.
957-958
Electronic Edition (ACM DL) BibTeX
- Dana Randall, David Wilson:
Sampling Spin Configurations of an Ising System.
959-960
Electronic Edition (ACM DL) BibTeX
- Mark Scharbrodt, Angelika Steger, Horst Weisser:
Approximability of Scheduling with Fixed Jobs.
961-962
Electronic Edition (ACM DL) BibTeX
- Jay Sethuraman, Mark S. Squillante:
Optimal Scheduling of Multiclass Parallel Machines.
963-964
Electronic Edition (ACM DL) BibTeX
- Ingo Schiermeyer, Bert Randerath:
Colouring Graphs with Prescribed Induced Cycle Lengths.
965-966
Electronic Edition (ACM DL) BibTeX
- Andreas S. Schulz, Robert Weismantel:
An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming.
967-968
Electronic Edition (ACM DL) BibTeX
- Subhash Suri, George Varghese:
Packet Filtering in High Speed Networks.
969-970
Electronic Edition (ACM DL) BibTeX
- Mario Szegedy:
A Slique Size Bounding Technique with Application to Non-Linear Codes.
971-972
Electronic Edition (ACM DL) BibTeX
- Eric Torng, Patchrawat Uthaisombut:
Lower Bounds for SRPT-Subsequence Algorithms for Nonpreemptive Scheduling.
973-974
Electronic Edition (ACM DL) BibTeX
- Santosh Vempala, Mihalis Yannakakis:
A Convex Relaxation for the Asymmetric TSP.
975-976
Electronic Edition (ACM DL) BibTeX
- Narayan Vikas:
Computational Complexity of Compaction to Cycles.
977-978
Electronic Edition (ACM DL) BibTeX
- David M. Warme, Pawel Winter, Martin Zachariasen:
Exact Solutions to Large-scale Plane Steiner Tree Problems.
979-980
Electronic Edition (ACM DL) BibTeX
- Kevin D. Wayne, Lisa Fleischer:
Faster Approximation Algorithms for Generalized Flow.
981-982
Electronic Edition (ACM DL) BibTeX
- Rebecca N. Wright, Sara Spalding:
Experimental Performance of Shared RSA Modulus Generation.
983-984
Electronic Edition (ACM DL) BibTeX
- Xinyu Xiang, Martin Held, Joseph S. B. Mitchell:
Fast and Effective Stripification of Polygonal Surface Models.
985-986
Electronic Edition (ACM DL) BibTeX
Copyright © Sat May 16 23:41:52 2009
by Michael Ley (ley@uni-trier.de)
