Abstract is missing.
- Clustering to minimize the sum of cluster diametersMoses Charikar, Rina Panigrahy. 1-10 [doi]
- Approximating min-sum ::::k::::-clustering in metric spacesYair Bartal, Moses Charikar, Danny Raz. 11-20 [doi]
- Local search heuristic for k-median and facility location problemsVijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, Vinayaka Pandit. 21-29 [doi]
- Profit-earning facility locationAdam Meyerson. 30-36 [doi]
- One-dimensional quantum walksAndris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous. 37-49 [doi]
- Quantum walks on graphsDorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani. 50-59 [doi]
- Quantum mechanical algorithms for the nonabelian hidden subgroup problemMichelangelo Grigni, Leonard J. Schulman, Monica Vazirani, Umesh V. Vazirani. 68-74 [doi]
- Minimax parametric optimization problems and multi-dimensional parametric searchingTakeshi Tokuyama. 75-83 [doi]
- Algorithms for minimizing weighted flow timeChandra Chekuri, Sanjeev Khanna, An Zhu. 84-93 [doi]
- Non-clairvoyant scheduling to minimize the average flow time on single and parallel machinesLuca Becchetti, Stefano Leonardi. 94-103 [doi]
- Interaction in quantum communication and the complexity of set disjointnessHartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman. 124-133 [doi]
- A new protocol and lower bounds for quantum coin flippingAndris Ambainis. 134-142 [doi]
- Loss-less condensers, unbalanced expanders, and extractorsAmnon Ta-Shma, Christopher Umans, David Zuckerman. 143-152 [doi]
- Conditions on input vectors for consensus solvability in asynchronous distributed systemsAchour Mostéfaoui, Sergio Rajsbaum, Michel Raynal. 153-162 [doi]
- Spatial gossip and resource location protocolsDavid Kempe, Jon M. Kleinberg, Alan J. Demers. 163-172 [doi]
- (1+epsilon, beta)-spanner constructions for general graphsMichael Elkin, David Peleg. 173-182 [doi]
- Approximate distance oraclesMikkel Thorup, Uri Zwick. 183-192 [doi]
- Extractor codesAmnon Ta-Shma, David Zuckerman. 193-199 [doi]
- Excellent codes from modular curvesNoam D. Elkies. 200-208 [doi]
- Sparse polynomial approximation in finite fieldsIgor Shparlinski. 209-215 [doi]
- Randomness efficient identity testing of multivariate polynomialsAdam Klivans, Daniel A. Spielman. 216-223 [doi]
- Euler paths in series parallel graphsS. Rao Kosaraju. 237-240 [doi]
- Decidability of string graphsMarcus Schaefer, Daniel Stefankovic. 241-246 [doi]
- Learning mixtures of arbitrary gaussiansSanjeev Arora, Ravi Kannan. 247-257 [doi]
- Learning DNF in time 2:::Õ(n:::1/3:::):::Adam Klivans, Rocco A. Servedio. 258-265 [doi]
- Sampling algorithms: lower bounds and applicationsZiv Bar-Yossef, Ravi Kumar, D. Sivakumar. 266-275 [doi]
- Testing metric propertiesMichal Parnas, Dana Ron. 276-285 [doi]
- Testing of matrix propertiesEldar Fischer, Ilan Newman. 286-295 [doi]
- Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial timeDaniel A. Spielman, Shang-Hua Teng. 296-305 [doi]
- One line and n pointsBernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr. 306-315 [doi]
- A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3DChristian Icking, Lihong Ma. 316-321 [doi]
- Sharp threshold and scaling window for the integer partitioning problemChristian Borgs, Jennifer T. Chayes, Boris Pittel. 330-336 [doi]
- A sharp threshold in proof complexityDimitris Achlioptas, Paul Beame, Michael S. O. Molloy. 337-346 [doi]
- Regular resolution lower bounds for the weak pigeonhole principleToniann Pitassi, Ran Raz. 347-355 [doi]
- The complexity of analytic tableauxNoriko H. Arai, Toniann Pitassi, Alasdair Urquhart. 356-363 [doi]
- Applications of approximation algorithms to cooperative gamesKamal Jain, Vijay V. Vazirani. 364-372 [doi]
- Approximation algorithms for constrained for constrained node weighted steiner tree problemsAnna Moss, Yuval Rabani. 373-382 [doi]
- A constant factor approximation for the single sink edge installation problemsSudipto Guha, Adam Meyerson, Kamesh Munagala. 383-388 [doi]
- Provisioning a virtual private network: a network design problem for multicommodity flowAnupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev Rastogi, Bülent Yener. 389-398 [doi]
- Explicit lower bound of ::::4.5n - o(n):::: for boolena circuitsOded Lachish, Ran Raz. 399-408 [doi]
- Lower bounds for matrix product, in bounded depth circuits with arbitrary gatesRan Raz, Amir Shpilka. 409-418 [doi]
- A read-once branching program lower bound of Omega(2:::n/4:::) for integer multiplication using universalBeate Bollig, Philipp Woelfel. 419-424 [doi]
- On the cell probe complexity of membership and perfect hashingRasmus Pagh. 425-432 [doi]
- On the integrality ratio of semidefinite relaxations of MAX CUTUriel Feige, Gideon Schechtman. 433-442 [doi]
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programmingMichel X. Goemans, David P. Williamson. 443-452 [doi]
- Non-approximability results for optimization problems on bounded degree instancesLuca Trevisan. 453-461 [doi]
- Colouring graphs when the number of colours is nearly the maximum degreeMichael Molloy, Bruce A. Reed. 462-470 [doi]
- Data-streams and histogramsSudipto Guha, Nick Koudas, Kyuseok Shim. 471-475 [doi]
- Optimal static range reporting in one dimension476-482 [doi]
- Biased dictionaries with fast insert/deletesFunda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha. 483-491 [doi]
- Anti-presistence: history independent data structuresMoni Naor, Vanessa Teague. 492-501 [doi]
- Dynamic TCP acknowledgement and other stories about e/(e-1)Anna R. Karlin, Claire Kenyon, Dana Randall. 502-509 [doi]
- The price of selfish routingMarios Mavronicolas, Paul G. Spirakis. 510-519 [doi]
- Buffer overflow management in QoS switchesAlexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko. 520-529 [doi]
- Almost optimal permutation routing on hypercubesBerthold Vöcking. 530-539 [doi]
- Online server allocation in a server farm via benefit task systemsT. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko. 540-549 [doi]
- Private approximation of NP-hard functionsShai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim. 550-559 [doi]
- Concurrent and resettable zero-knowledge in poly-loalgorithm roundsJoe Kilian, Erez Petrank. 560-569 [doi]
- Black-box concurrent zero-knowledge requires Omega~(log n) roundsRan Canetti, Joe Kilian, Erez Petrank, Alon Rosen. 570-579 [doi]
- The round complexity of verifiable secret sharing and secure multicastRosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin. 580-589 [doi]
- Communication preserving protocols for secure function evaluationMoni Naor, Kobbi Nissim. 590-599 [doi]
- Some perspective on computational complexity (abstract)Andrew Chi-Chih Yao. 600 [doi]
- A sieve algorithm for the shortest lattice vector problemMiklós Ajtai, Ravi Kumar, D. Sivakumar. 601-610 [doi]
- Fast computation of low rank matrixDimitris Achlioptas, Frank McSherry. 611-618 [doi]
- Spectral analysis of dataYossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, Jared Saia. 619-626 [doi]
- Optimal outlier removal in high-dimensionalJohn Dunagan, Santosh Vempala. 627-636 [doi]
- Estimating true evolutionary distances between genomesLi-San Wang, Tandy Warnow. 637-646 [doi]
- On optimal slicing of parallel programsMarkus Müller-Olm, Helmut Seidl. 647-656 [doi]
- When is the evaluation of conjunctive queries tractable?Martin Grohe, Thomas Schwentick, Luc Segoufin. 657-666 [doi]
- The complexity of maximal constraint languagesAndrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons. 667-674 [doi]
- Quantitative solution of omega-regular gamesLuca de Alfaro, Rupak Majumdar. 675-683 [doi]
- Distribution functions of probabilistic automataFarrokh Vatan. 684-693 [doi]
- Compatible sequences and a slow Winkler percolationPéter Gács. 694-703 [doi]
- Edge isoperimetry and rapid mixing on matroids and geometric Markov chainsRavi Montenegro, Jung-Bae Son. 704-711 [doi]
- A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entriesMark Jerrum, Alistair Sinclair, Eric Vigoda. 712-721 [doi]
- Computing with continuous-time Liapunov systemsJirí Síma, Pekka Orponen. 722-731 [doi]
- Complex tilingsBruno Durand, Leonid A. Levin, Alexander Shen. 732-739 [doi]
- Running time and program size for self-assembled squaresLeonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang. 740-748 [doi]
- Algorithms, games, and the internetChristos H. Papadimitriou. 749-753 [doi]
- Automata, circuits and hybrids: facets of continuous timeBoris A. Trakhtenbrot. 754-755 [doi]