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
Electronic Edition (link) BibTeX
- Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire:
The Nonstochastic Multiarmed Bandit Problem.
48-77
Electronic Edition (link) BibTeX
- Idit Keidar, Roger Khazan:
A Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach.
78-130
Electronic Edition (link) BibTeX
- Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
An Approximate L1-Difference Algorithm for Massive Data Streams.
131-151
Electronic Edition (link) BibTeX
- Luc Devroye:
Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees.
152-171
Electronic Edition (link) BibTeX
- Uriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan:
Approximating the Domatic Number.
172-195
Electronic Edition (link) BibTeX
- Etienne Grandjean, Thomas Schwentick:
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time.
196-230
Electronic Edition (link) BibTeX
- Guy Even, Sudipto Guha, Baruch Schieber:
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas.
231-252
Electronic Edition (link) BibTeX
- Narayan Vikas:
Computational Complexity of Compaction to Reflexive Cycles.
253-280
Electronic Edition (link) BibTeX
Volume 32,
Number 2,
2003
- Paola Flocchini, Alessandro Roncato, Nicola Santoro:
Backward Consistency and Sense of Direction in Advanced Distributed Systems.
281-306
Electronic Edition (link) BibTeX
- Csaba D. Tóth:
Binary Space Partitions for Line Segments with a Limited Number of Directions.
307-325
Electronic Edition (link) BibTeX
- Tom Bohman, Alan M. Frieze:
Arc-Disjoint Paths in Expander Digraphs.
326-344
Electronic Edition (link) BibTeX
- Uriel Feige, Robert Krauthgamer:
The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set.
345-370
Electronic Edition (link) BibTeX
- David Gamarnik:
Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks.
371-385
Electronic Edition (link) BibTeX
- John A. Ellis, Stirling Chow, Dennis Manke:
Many to One Embeddings from Grids into Cylinders, Tori, and Hypercubes.
386-407
Electronic Edition (link) BibTeX
- Zhi-Zhong Chen, Xin He, Ming-Yang Kao:
Common-Face Embeddings of Planar Graphs.
408-434
Electronic Edition (link) BibTeX
- Bernard Mourrain, Victor Y. Pan, Olivier Ruatta:
Accelerated Solution of Multivariate Polynomial Systems of Equations.
435-454
Electronic Edition (link) BibTeX
- Steven S. Seiden, Rob van Stee, Leah Epstein:
New Bounds for Variable-Sized Online Bin Packing.
455-469
Electronic Edition (link) BibTeX
- Samir Khuller, Randeep Bhatia, Robert Pless:
On Local Search and Placement of Meters in Networks.
470-487
Electronic Edition (link) BibTeX
- Ran Raz, Amir Shpilka:
Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates.
488-513
Electronic Edition (link) BibTeX
- Thomas Eiter, Georg Gottlob, Kazuhisa Makino:
New Results on Monotone Dualization and Generating Hypergraph Transversals.
514-537
Electronic Edition (link) BibTeX
- Tomás Feder, Rajeev Motwani, Rina Panigrahy, Chris Olston, Jennifer Widom:
Computing the Median with Uncertainty.
538-547
Electronic Edition (link) BibTeX
- Xinmao Wang, Victor Y. Pan:
Acceleration of Euclidean Algorithm and Rational Number Reconstruction.
548-556
Electronic Edition (link) BibTeX
Volume 32,
Number 3,
2003
Volume 32,
Number 4,
2003
- Satoru Iwata:
A Faster Scaling Algorithm for Minimizing Submodular Functions.
833-840
Electronic Edition (link) BibTeX
- Vladlen Koltun, Micha Sharir:
The Partition Technique for Overlays of Envelopes.
841-863
Electronic Edition (link) BibTeX
- Zhi-Zhong Chen, Tao Jiang, Guohui Lin:
Computing Phylogenetic Roots with Bounded Degrees and Errors.
864-879
Electronic Edition (link) BibTeX
- Jens Liebehenschel:
Lexicographical Generation of a Generalized Dyck Language.
880-903
Electronic Edition (link) BibTeX
- Hua-Huai Chern, Hsien-Kuei Hwang:
Partial Match Queries in Random Quadtrees.
904-915
Electronic Edition (link) BibTeX
- Sean Hallgren, Alexander Russell, Amnon Ta-Shma:
The Hidden Subgroup Problem and Quantum Computation Using Group Representations.
916-934
Electronic Edition (link) BibTeX
- Michael Molloy:
Models for Random Constraint Satisfaction Problems.
935-949
Electronic Edition (link) BibTeX
- Joost Engelfriet, Sebastian Maneth:
Macro Tree Translations of Linear Size Increase are MSO Definable.
950-1006
Electronic Edition (link) BibTeX
- Injong Rhee, Jennifer L. Welch:
The Impact of Timing Knowledge on the Session Problem.
1007-1039
Electronic Edition (link) BibTeX
- Hung Q. Ngo, Van H. Vu:
Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs.
1040-1049
Electronic Edition (link) BibTeX
- Joseph Cheriyan, Santosh Vempala, Adrian Vetta:
An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph.
1050-1055
Electronic Edition (link) BibTeX
- Richard Cole, Ramesh Hariharan:
Tree Pattern Matching to Subset Matching in Linear Time.
1056-1066
Electronic Edition (link) BibTeX
- Mario Valencia-Pabon:
Revisiting Tucker's Algorithm to Color Circular Arc Graphs.
1067-1072
Electronic Edition (link) BibTeX
- Xiaotie Deng, Guojun Li, Zimao Li, Bin Ma, Lusheng Wang:
Genetic Design of Drugs Without Side-Effects.
1073-1090
Electronic Edition (link) BibTeX
- Amotz Bar-Noy, Richard E. Ladner:
Windows Scheduling Problems for Broadcast Systems.
1091-1113
Electronic Edition (link) BibTeX
Volume 32,
Number 5,
2003
- David Fernández-Baca, Jens Lagergren:
A Polynomial-Time Algorithm for Near-Perfect Phylogeny.
1115-1127
Electronic Edition (link) BibTeX
- Martin Kochol, Vadim V. Lozin, Bert Randerath:
The 3-Colorability Problem on Graphs with Maximum Degree Four.
1128-1139
Electronic Edition (link) BibTeX
- Scott Aaronson:
Algorithms for Boolean Function Query Properties.
1140-1157
Electronic Edition (link) BibTeX
- Michal Parnas, Dana Ron, Ronitt Rubinfeld:
On Testing Convexity and Submodularity.
1158-1184
Electronic Edition (link) BibTeX
- Amir Shpilka:
Lower Bounds for Matrix Product.
1185-1200
Electronic Edition (link) BibTeX
- Jian Shen, Li Sheng, Jie Wu:
Searching for Sorted Sequences of Kings in Tournaments.
1201-1209
Electronic Edition (link) BibTeX
- Yoshiharu Kohayakawa, Vojtech Rödl, Lubos Thoma:
An Optimal Algorithm for Checking Regularity.
1210-1235
Electronic Edition (link) BibTeX
- Jack H. Lutz:
Dimension in Complexity Classes.
1236-1259
Electronic Edition (link) BibTeX
- Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg:
The Natural Work-Stealing Algorithm is Stable.
1260-1279
Electronic Edition (link) BibTeX
- Markus Püschel, José M. F. Moura:
The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms.
1280-1316
Electronic Edition (link) BibTeX
- Sanjeev Arora, George Karakostas:
Approximation Schemes for Minimum Latency Problems.
1317-1337
Electronic Edition (link) BibTeX
- Edith Cohen, Eran Halperin, Haim Kaplan, Uri Zwick:
Reachability and Distance Queries via 2-Hop Labels.
1338-1355
Electronic Edition (link) BibTeX
- Ran Raz:
On the Complexity of Matrix Product.
1356-1369
Electronic Edition (link) BibTeX
- Joseph Y.-T. Leung, Michael Pinedo:
Minimizing Total Completion Time on Parallel Machines with Deadline Constraints.
1370-1388
Electronic Edition (link) BibTeX
- Oliver Glier:
Kolmogorov Complexity and Deterministic Context-Free Languages.
1389-1394
Electronic Edition (link) BibTeX
Volume 32,
Number 6,
2003
- Andreas Björklund, Thore Husfeldt:
Finding a Path of Superlogarithmic Length.
1395-1402
Electronic Edition (link) BibTeX
- Amos Fiat, Manor Mendel:
Better Algorithms for Unfair Metrical Task Systems and Applications.
1403-1422
Electronic Edition (link) BibTeX
- Tetsuo Asano, Naoki Katoh, Koji Obokata, Takeshi Tokuyama:
Matrix Rounding under the Lp-Discrepancy Measure and Its Application to Digital Halftoning.
1423-1435
Electronic Edition (link) BibTeX
- Joachim von zur Gathen, Igor Shparlinski, Alistair Sinclair:
Finding Points on Curves over Finite Fields.
1436-1448
Electronic Edition (link) BibTeX
- John H. Reif, Zheng Sun:
On Frictional Mechanical Systems and Their Computational Power.
1449-1474
Electronic Edition (link) BibTeX
- Vince Grolmusz:
Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications.
1475-1487
Electronic Edition (link) BibTeX
- Lars Arge, Jeffrey Scott Vitter:
Optimal External Memory Interval Management.
1488-1508
Electronic Edition (link) BibTeX
- V. S. Anil Kumar, H. Ramesh:
Covering Rectilinear Polygons with Axis-Parallel Rectangles.
1509-1541
Electronic Edition (link) BibTeX
- Todd Ebert, Wolfgang Merkle, Heribert Vollmer:
On the Autoreducibility of Random Sequences.
1542-1569
Electronic Edition (link) BibTeX
- Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson:
The Quantum Communication Complexity of Sampling.
1570-1585
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Peter Braß:
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip.
1621-1653
Electronic Edition (link) BibTeX
- Maxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson:
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices.
1654-1673
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:18:56 2009
by Michael Ley (ley@uni-trier.de)
