- Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky:
Reducibility and Completeness in Private Computations. SIAM J. Comput. 29(4): 1189-1208 (2000) - Tracy Kimbrel, Anna R. Karlin:
Near-Optimal Parallel Prefetching and Caching. SIAM J. Comput. 29(4): 1051-1082 (2000) - Håkan Lennerstad, Lars Lundberg:
Optimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems. SIAM J. Comput. 29(6): 1816-1838 (2000) - Wei-Liang Lin, Amir H. Farrahi, Majid Sarrafzadeh:
On the Power of Logic Resynthesis. SIAM J. Comput. 29(4): 1257-1289 (2000) - Dahlia Malkhi, Michael K. Reiter, Avishai Wool:
The Load and Availability of Byzantine Quorum Systems. SIAM J. Comput. 29(6): 1889-1906 (2000) - Scott A. Mitchell, Stephen A. Vavasis:
Quality Mesh Generation in Higher Dimensions. SIAM J. Comput. 29(4): 1334-1370 (2000) - Leszek Pacholski, Wieslaw Szwast, Lidia Tendera:
Complexity Results for First-Order Two-Variable Logic with Counting. SIAM J. Comput. 29(4): 1083-1117 (2000) - Johannes A. La Poutré:
Maintenance of 2- and 3-Edge-Connected Components of Graphs II. SIAM J. Comput. 29(5): 1521-1549 (2000) - Sridhar Rajagopalan, Leonard J. Schulman:
Verification of Identities. SIAM J. Comput. 29(4): 1155-1163 (2000) - Klaus Reinhardt, Eric Allender:
Making Nondeterminism Unambiguous. SIAM J. Comput. 29(4): 1118-1131 (2000) - Michael E. Saks, Fotios Zaharoglou:
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. SIAM J. Comput. 29(5): 1449-1483 (2000) - Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap:
Precision-Sensitive Euclidean Shortest Path in 3-Space. SIAM J. Comput. 29(5): 1577-1595 (2000) - Ladislav Stacho, Imrich Vrto:
Virtual Path Layouts in ATM Networks. SIAM J. Comput. 29(5): 1621-1629 (2000) - Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, David P. Williamson:
Gadgets, Approximation, and Linear Programming. SIAM J. Comput. 29(6): 2074-2097 (2000) - Millist W. Vincent, Mark Levene:
Restructuring Partitioned Normal Form Relations without Information Loss. SIAM J. Comput. 29(5): 1550-1567 (2000) - Dan E. Willard:
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree. SIAM J. Comput. 29(3): 1030-1049 (2000) - 1999
- Pankaj K. Agarwal, Alon Efrat, Micha Sharir:
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. SIAM J. Comput. 29(3): 912-953 (1999) - Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber:
The Angular-Metric Traveling Salesman Problem. SIAM J. Comput. 29(3): 697-711 (1999) - Susanne Albers:
Better Bounds for Online Scheduling. SIAM J. Comput. 29(2): 459-473 (1999) - Matthew Andrews, Frank Thomson Leighton, Panagiotis Takis Metaxas, Lisa Zhang:
Automatic Methods for Hiding Latency in Parallel and Distributed Computation. SIAM J. Comput. 29(2): 615-647 (1999) - Shoshana Anily, Michel Gendreau, Gilbert Laporte:
The Swapping Problem on a Line. SIAM J. Comput. 29(1): 327-335 (1999) - Esther M. Arkin, Yi-Jen Chiang, Joseph S. B. Mitchell, Steven Skiena, Tae-Cheon Yang:
On the Maximum Scatter Traveling Salesperson Problem. SIAM J. Comput. 29(2): 515-544 (1999) - Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal:
Balanced Allocations. SIAM J. Comput. 29(1): 180-200 (1999) - Stephen J. Bellantoni, Karl-Heinz Niggl:
Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited. SIAM J. Comput. 29(2): 401-415 (1999) - Claudia Bertram-Kretzberg, Hanno Lefmann:
The Algorithmic Aspects of Uncrowded Hypergraphs. SIAM J. Comput. 29(1): 201-230 (1999) - Eberhard Bertsch, Mark-Jan Nederhof:
Regular Closure of Deterministic Languages. SIAM J. Comput. 29(1): 81-102 (1999) - Sandeep N. Bhatt, David S. Greenberg, Frank Thomson Leighton, Pangfeng Liu:
Tight Bounds for On-Line Tree Embeddings. SIAM J. Comput. 29(2): 474-491 (1999) - Paolo Boldi, Sebastiano Vigna:
Complexity of Deciding Sense of Direction. SIAM J. Comput. 29(3): 779-789 (1999) - Maria Luisa Bonet, Cynthia A. Phillips, Tandy J. Warnow, Shibu Yooseph:
Constructing Evolutionary Trees in the Presence of Polymorphic Characters. SIAM J. Comput. 29(1): 103-131 (1999) - Josef M. Breutzmann, Jack H. Lutz:
Equivalence of Measures of Complexity Classes. SIAM J. Comput. 29(1): 302-326 (1999)