Conferences in DBLP
Moses Charikar , Rina Panigrahy Clustering to minimize the sum of cluster diameters. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:1-10 [Conf ] Yair Bartal , Moses Charikar , Danny Raz Approximating min-sum k -clustering in metric spaces. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:11-20 [Conf ] Vijay Arya , Naveen Garg , Rohit Khandekar , Adam Meyerson , Kamesh Munagala , Vinayaka Pandit Local search heuristic for k-median and facility location problems. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:21-29 [Conf ] Adam Meyerson Profit-earning facility location. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:30-36 [Conf ] Andris Ambainis , Eric Bach , Ashwin Nayak , Ashvin Vishwanath , John Watrous One-dimensional quantum walks. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:37-49 [Conf ] Dorit Aharonov , Andris Ambainis , Julia Kempe , Umesh V. Vazirani Quantum walks on graphs. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:50-59 [Conf ] John Watrous Quantum algorithms for solvable groups. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:60-67 [Conf ] Michelangelo Grigni , Leonard J. Schulman , Monica Vazirani , Umesh V. Vazirani Quantum mechanical algorithms for the nonabelian hidden subgroup problem. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:68-74 [Conf ] Takeshi Tokuyama Minimax parametric optimization problems and multi-dimensional parametric searching. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:75-83 [Conf ] Chandra Chekuri , Sanjeev Khanna , An Zhu Algorithms for minimizing weighted flow time. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:84-93 [Conf ] Luca Becchetti , Stefano Leonardi Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:94-103 [Conf ] Tim Roughgarden Stackelberg scheduling strategies. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:104-113 [Conf ] Leslie G. Valiant Quantum computers that can be simulated classically in polynomial time. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:114-123 [Conf ] Hartmut Klauck , Ashwin Nayak , Amnon Ta-Shma , David Zuckerman Interaction in quantum communication and the complexity of set disjointness. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:124-133 [Conf ] Andris Ambainis A new protocol and lower bounds for quantum coin flipping. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:134-142 [Conf ] Amnon Ta-Shma , Christopher Umans , David Zuckerman Loss-less condensers, unbalanced expanders, and extractors. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:143-152 [Conf ] Achour Mostéfaoui , Sergio Rajsbaum , Michel Raynal Conditions on input vectors for consensus solvability in asynchronous distributed systems. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:153-162 [Conf ] David Kempe , Jon M. Kleinberg , Alan J. Demers Spatial gossip and resource location protocols. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:163-172 [Conf ] Michael Elkin , David Peleg (1+epsilon, beta)-spanner constructions for general graphs. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:173-182 [Conf ] Mikkel Thorup , Uri Zwick Approximate distance oracles. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:183-192 [Conf ] Amnon Ta-Shma , David Zuckerman Extractor codes. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:193-199 [Conf ] Noam D. Elkies Excellent codes from modular curves. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:200-208 [Conf ] Igor Shparlinski Sparse polynomial approximation in finite fields. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:209-215 [Conf ] Adam Klivans , Daniel A. Spielman Randomness efficient identity testing of multivariate polynomials. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:216-223 [Conf ] Mikkel Thorup Fully-dynamic min-cut. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:224-230 [Conf ] Martin Grohe Computing crossing numbers in quadratic time. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:231-236 [Conf ] S. Rao Kosaraju Euler paths in series parallel graphs. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:237-240 [Conf ] Marcus Schaefer , Daniel Stefankovic Decidability of string graphs. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:241-246 [Conf ] Sanjeev Arora , Ravi Kannan Learning mixtures of arbitrary gaussians. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:247-257 [Conf ] Adam Klivans , Rocco A. Servedio Learning DNF in time 2^{Õ(n1/3)} . [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:258-265 [Conf ] Ziv Bar-Yossef , Ravi Kumar , D. Sivakumar Sampling algorithms: lower bounds and applications. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:266-275 [Conf ] Michal Parnas , Dana Ron Testing metric properties. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:276-285 [Conf ] Eldar Fischer , Ilan Newman Testing of matrix properties. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:286-295 [Conf ] Daniel A. Spielman , Shang-Hua Teng Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:296-305 [Conf ] Bernd Gärtner , József Solymosi , Falk Tschirschnitz , Emo Welzl , Pavel Valtr One line and n points. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:306-315 [Conf ] Christian Icking , Lihong Ma A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:316-321 [Conf ] Bernard Chazelle , Ding Liu Lower bounds for intersection searching and fractional cascading in higher dimension. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:322-329 [Conf ] Christian Borgs , Jennifer T. Chayes , Boris Pittel Sharp threshold and scaling window for the integer partitioning problem. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:330-336 [Conf ] Dimitris Achlioptas , Paul Beame , Michael S. O. Molloy A sharp threshold in proof complexity. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:337-346 [Conf ] Toniann Pitassi , Ran Raz Regular resolution lower bounds for the weak pigeonhole principle. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:347-355 [Conf ] Noriko H. Arai , Toniann Pitassi , Alasdair Urquhart The complexity of analytic tableaux. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:356-363 [Conf ] Kamal Jain , Vijay V. Vazirani Applications of approximation algorithms to cooperative games. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:364-372 [Conf ] Anna Moss , Yuval Rabani Approximation algorithms for constrained for constrained node weighted steiner tree problems. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:373-382 [Conf ] Sudipto Guha , Adam Meyerson , Kamesh Munagala A constant factor approximation for the single sink edge installation problems. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:383-388 [Conf ] Anupam Gupta , Jon M. Kleinberg , Amit Kumar , Rajeev Rastogi , Bülent Yener Provisioning a virtual private network: a network design problem for multicommodity flow. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:389-398 [Conf ] Oded Lachish , Ran Raz Explicit lower bound of 4.5n - o(n) for boolena circuits. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:399-408 [Conf ] Ran Raz , Amir Shpilka Lower bounds for matrix product, in bounded depth circuits with arbitrary gates. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:409-418 [Conf ] Beate Bollig , Philipp Woelfel A read-once branching program lower bound of Omega(2^{n/4} ) for integer multiplication using universal. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:419-424 [Conf ] Rasmus Pagh On the cell probe complexity of membership and perfect hashing. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:425-432 [Conf ] Uriel Feige , Gideon Schechtman On the integrality ratio of semidefinite relaxations of MAX CUT. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:433-442 [Conf ] Michel X. Goemans , David P. Williamson Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:443-452 [Conf ] Luca Trevisan Non-approximability results for optimization problems on bounded degree instances. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:453-461 [Conf ] Michael Molloy , Bruce A. Reed Colouring graphs when the number of colours is nearly the maximum degree. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:462-470 [Conf ] Sudipto Guha , Nick Koudas , Kyuseok Shim Data-streams and histograms. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:471-475 [Conf ] Stephen Alstrup , Gerth Stølting Brodal , Theis Rauhe Optimal static range reporting in one dimension. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:476-482 [Conf ] Funda Ergün , Süleyman Cenk Sahinalp , Jonathan Sharp , Rakesh K. Sinha Biased dictionaries with fast insert/deletes. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:483-491 [Conf ] Moni Naor , Vanessa Teague Anti-presistence: history independent data structures. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:492-501 [Conf ] Anna R. Karlin , Claire Kenyon , Dana Randall Dynamic TCP acknowledgement and other stories about e/(e-1). [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:502-509 [Conf ] Marios Mavronicolas , Paul G. Spirakis The price of selfish routing. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:510-519 [Conf ] Alexander Kesselman , Zvi Lotker , Yishay Mansour , Boaz Patt-Shamir , Baruch Schieber , Maxim Sviridenko Buffer overflow management in QoS switches. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:520-529 [Conf ] Berthold Vöcking Almost optimal permutation routing on hypercubes. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:530-539 [Conf ] T. S. Jayram , Tracy Kimbrel , Robert Krauthgamer , Baruch Schieber , Maxim Sviridenko Online server allocation in a server farm via benefit task systems. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:540-549 [Conf ] Shai Halevi , Robert Krauthgamer , Eyal Kushilevitz , Kobbi Nissim Private approximation of NP-hard functions. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:550-559 [Conf ] Joe Kilian , Erez Petrank Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:560-569 [Conf ] Ran Canetti , Joe Kilian , Erez Petrank , Alon Rosen Black-box concurrent zero-knowledge requires Omega~(log n) rounds. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:570-579 [Conf ] Rosario Gennaro , Yuval Ishai , Eyal Kushilevitz , Tal Rabin The round complexity of verifiable secret sharing and secure multicast. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:580-589 [Conf ] Moni Naor , Kobbi Nissim Communication preserving protocols for secure function evaluation. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:590-599 [Conf ] Andrew Chi-Chih Yao Some perspective on computational complexity (abstract). [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:600- [Conf ] Miklós Ajtai , Ravi Kumar , D. Sivakumar A sieve algorithm for the shortest lattice vector problem. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:601-610 [Conf ] Dimitris Achlioptas , Frank McSherry Fast computation of low rank matrix. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:611-618 [Conf ] Yossi Azar , Amos Fiat , Anna R. Karlin , Frank McSherry , Jared Saia Spectral analysis of data. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:619-626 [Conf ] John Dunagan , Santosh Vempala Optimal outlier removal in high-dimensional. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:627-636 [Conf ] Li-San Wang , Tandy Warnow Estimating true evolutionary distances between genomes. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:637-646 [Conf ] Markus Müller-Olm , Helmut Seidl On optimal slicing of parallel programs. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:647-656 [Conf ] Martin Grohe , Thomas Schwentick , Luc Segoufin When is the evaluation of conjunctive queries tractable? [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:657-666 [Conf ] Andrei A. Bulatov , Andrei A. Krokhin , Peter Jeavons The complexity of maximal constraint languages. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:667-674 [Conf ] Luca de Alfaro , Rupak Majumdar Quantitative solution of omega-regular games. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:675-683 [Conf ] Farrokh Vatan Distribution functions of probabilistic automata. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:684-693 [Conf ] Péter Gács Compatible sequences and a slow Winkler percolation. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:694-703 [Conf ] Ravi Montenegro , Jung-Bae Son Edge isoperimetry and rapid mixing on matroids and geometric Markov chains. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:704-711 [Conf ] Mark Jerrum , Alistair Sinclair , Eric Vigoda A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:712-721 [Conf ] Jirí Síma , Pekka Orponen Computing with continuous-time Liapunov systems. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:722-731 [Conf ] Bruno Durand , Leonid A. Levin , Alexander Shen Complex tilings. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:732-739 [Conf ] Leonard M. Adleman , Qi Cheng , Ashish Goel , Ming-Deh A. Huang Running time and program size for self-assembled squares. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:740-748 [Conf ] Christos H. Papadimitriou Algorithms, games, and the internet. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:749-753 [Conf ] Boris A. Trakhtenbrot Automata, circuits and hybrids: facets of continuous time. [Citation Graph (0, 0)][DBLP ] STOC, 2001, pp:754-755 [Conf ]