default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Computing, Volume 32
Volume 32, Number 1, 2002
- Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen:
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds. 1-47 - Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire:
The Nonstochastic Multiarmed Bandit Problem. 48-77 - Idit Keidar, Roger Khazan:
A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach. 78-130 - Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
An Approximate L1-Difference Algorithm for Massive Data Streams. 131-151 - Luc Devroye:
Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees. 152-171 - Uriel Feige, Magnús M. Halldórsson
, Guy Kortsarz, Aravind Srinivasan:
Approximating the Domatic Number. 172-195 - Etienne Grandjean, Thomas Schwentick:
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time. 196-230 - Guy Even, Sudipto Guha, Baruch Schieber:
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas. 231-252 - Narayan Vikas:
Computational Complexity of Compaction to Reflexive Cycles. 253-280
Volume 32, Number 2, 2003
- Paola Flocchini, Alessandro Roncato, Nicola Santoro:
Backward Consistency and Sense of Direction in Advanced Distributed Systems. 281-306 - Csaba D. Tóth:
Binary Space Partitions for Line Segments with a Limited Number of Directions. 307-325 - Tom Bohman, Alan M. Frieze:
Arc-Disjoint Paths in Expander Digraphs. 326-344 - Uriel Feige, Robert Krauthgamer:
The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set. 345-370 - David Gamarnik:
Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks. 371-385 - John A. Ellis, Stirling Chow, Dennis Manke:
Many to One Embeddings from Grids into Cylinders, Tori, and Hypercubes. 386-407 - Zhi-Zhong Chen, Xin He, Ming-Yang Kao:
Common-Face Embeddings of Planar Graphs. 408-434 - Bernard Mourrain, Victor Y. Pan, Olivier Ruatta:
Accelerated Solution of Multivariate Polynomial Systems of Equations. 435-454 - Steven S. Seiden, Rob van Stee, Leah Epstein:
New Bounds for Variable-Sized Online Bin Packing. 455-469 - Samir Khuller, Randeep Bhatia, Robert Pless:
On Local Search and Placement of Meters in Networks. 470-487 - Ran Raz, Amir Shpilka:
Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates. 488-513 - Thomas Eiter, Georg Gottlob, Kazuhisa Makino:
New Results on Monotone Dualization and Generating Hypergraph Transversals. 514-537 - Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom:
Computing the Median with Uncertainty. 538-547 - Xinmao Wang, Victor Y. Pan:
Acceleration of Euclidean Algorithm and Rational Number Reconstruction. 548-556
Volume 32, Number 3, 2003
- Hasan Cam:
Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks. 557-585 - Dan Boneh, Matthew K. Franklin:
Identity-Based Encryption from the Weil Pairing. 586-615 - Vladlen Koltun, Micha Sharir:
3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations. 616-642 - David Eppstein:
Setting Parameters by Example. 643-653 - Stephan J. Eidenbenz, Peter Widmayer:
An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. 654-670 - Oliver Braun, Günter Schmidt:
Parallel Processor Scheduling with Limited Number of Preemptions. 671-680 - Ronald de Wolf:
Nondeterministic Quantum Query and Communication Complexities. 681-699 - Timothy M. Chan:
Semi-Online Maintenance of Geometric Optima and Measures. 700-716 - John F. Rudin III, R. Chandrasekaran:
Improved Bounds for the Online Scheduling Problem. 717-735 - Thore Husfeldt, Theis Rauhe:
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems. 736-753 - Nadia El-Mabrouk, David Sankoff:
The Reconstruction of Doubled Genomes. 754-792 - Sunil Arya, Ho-Yam Addy Fu:
Expected-Case Complexity of Approximate Nearest Neighbor Searching. 793-815 - Ramgopal R. Mettu, C. Greg Plaxton:
The Online Median Problem. 816-832
Volume 32, Number 4, 2003
- Satoru Iwata:
A Faster Scaling Algorithm for Minimizing Submodular Functions. 833-840 - Vladlen Koltun, Micha Sharir:
The Partition Technique for Overlays of Envelopes. 841-863 - Zhi-Zhong Chen, Tao Jiang, Guohui Lin:
Computing Phylogenetic Roots with Bounded Degrees and Errors. 864-879 - Jens Liebehenschel:
Lexicographical Generation of a Generalized Dyck Language. 880-903 - Hua-Huai Chern, Hsien-Kuei Hwang:
Partial Match Queries in Random Quadtrees. 904-915 - Sean Hallgren, Alexander Russell, Amnon Ta-Shma:
The Hidden Subgroup Problem and Quantum Computation Using Group Representations. 916-934 - Michael Molloy:
Models for Random Constraint Satisfaction Problems. 935-949 - Joost Engelfriet, Sebastian Maneth:
Macro Tree Translations of Linear Size Increase are MSO Definable. 950-1006 - Injong Rhee, Jennifer L. Welch:
The Impact of Timing Knowledge on the Session Problem. 1007-1039 - Hung Q. Ngo, Van H. Vu:
Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs. 1040-1049 - Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta:
An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph. 1050-1055 - Richard Cole, Ramesh Hariharan:
Tree Pattern Matching to Subset Matching in Linear Time. 1056-1066 - Mario Valencia-Pabon:
Revisiting Tucker's Algorithm to Color Circular Arc Graphs. 1067-1072 - Xiaotie Deng, Guojun Li, Zimao Li, Bin Ma, Lusheng Wang:
Genetic Design of Drugs Without Side-Effects. 1073-1090 - Amotz Bar-Noy, Richard E. Ladner:
Windows Scheduling Problems for Broadcast Systems. 1091-1113
Volume 32, Number 5, 2003
- David Fernández-Baca, Jens Lagergren:
A Polynomial-Time Algorithm for Near-Perfect Phylogeny. 1115-1127 - Martin Kochol, Vadim V. Lozin, Bert Randerath:
The 3-Colorability Problem on Graphs with Maximum Degree Four. 1128-1139 - Scott Aaronson:
Algorithms for Boolean Function Query Properties. 1140-1157 - Michal Parnas, Dana Ron, Ronitt Rubinfeld:
On Testing Convexity and Submodularity. 1158-1184 - Amir Shpilka:
Lower Bounds for Matrix Product. 1185-1200 - Jian Shen, Li Sheng, Jie Wu:
Searching for Sorted Sequences of Kings in Tournaments. 1201-1209 - Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma:
An Optimal Algorithm for Checking Regularity. 1210-1235 - Jack H. Lutz:
Dimension in Complexity Classes. 1236-1259 - Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg:
The Natural Work-Stealing Algorithm is Stable. 1260-1279 - Markus Püschel, José M. F. Moura:
The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms. 1280-1316 - Sanjeev Arora, George Karakostas:
Approximation Schemes for Minimum Latency Problems. 1317-1337 - Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick:
Reachability and Distance Queries via 2-Hop Labels. 1338-1355 - Ran Raz:
On the Complexity of Matrix Product. 1356-1369 - Joseph Y.-T. Leung, Michael L. Pinedo:
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints. 1370-1388 - Oliver Glier:
Kolmogorov Complexity and Deterministic Context-Free Languages. 1389-1394
Volume 32, Number 6, 2003
- Andreas Björklund, Thore Husfeldt:
Finding a Path of Superlogarithmic Length. 1395-1402 - Amos Fiat, Manor Mendel:
Better Algorithms for Unfair Metrical Task Systems and Applications. 1403-1422 - Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama:
Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning. 1423-1435 - Joachim von zur Gathen, Igor E. Shparlinski, Alistair Sinclair:
Finding Points on Curves over Finite Fields. 1436-1448 - John H. Reif, Zheng Sun:
On Frictional Mechanical Systems and Their Computational Power. 1449-1474 - Vince Grolmusz:
Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications. 1475-1487 - Lars Arge, Jeffrey Scott Vitter:
Optimal External Memory Interval Management. 1488-1508 - V. S. Anil Kumar, H. Ramesh:
Covering Rectilinear Polygons with Axis-Parallel Rectangles. 1509-1541 - Todd Ebert, Wolfgang Merkle, Heribert Vollmer:
On the Autoreducibility of Random Sequences. 1542-1569 - Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson:
The Quantum Communication Complexity of Sampling. 1570-1585 - Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean:
The Expected Number of 3D Visibility Events Is Linear. 1586-1620 - Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Peter Braß:
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip. 1621-1653 - Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson:
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices. 1654-1673
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-01 22:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
