Volume 75,
Numbers 1-2,
31 July 2000
- Béatrice Bérard, Catherine Dufourd:
Timed automata and additive clock constraints.
1-7
Electronic Edition (link) BibTeX
- Charles J. Colbourn, Alan C. H. Ling:
Quorums from difference covers.
9-12
Electronic Edition (link) BibTeX
- Mayer Goldberg:
Gödelization in the lambda calculus.
13-16
Electronic Edition (link) BibTeX
- Jacob M. Howe, Andy King:
Abstracting numeric constraints with Boolean functions.
17-23
Electronic Edition (link) BibTeX
- Meghanad D. Wagh, Prakash Math, Osman Guzide:
Cyclic-cubes and wrap-around butterflies.
25-27
Electronic Edition (link) BibTeX
- Michal Penn, Moshe Tennenholtz:
Constrained multi-object auctions and b-matching.
29-34
Electronic Edition (link) BibTeX
- Ju-Hong Lee, Deok-Hwan Kim, Seok-Lyong Lee, Chin-Wan Chung, Guang-Ho Cha:
Distributed similarity search algorithm in distributed heterogeneous multimedia databases.
35-42
Electronic Edition (link) BibTeX
- Ari Freund, Howard J. Karloff:
A lower bound of 8/(7+(1/k)-1) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut.
43-50
Electronic Edition (link) BibTeX
- A. Benjamin Premkumar:
On the optimal utilization of all available states in the 2n moduli set.
51-56
Electronic Edition (link) BibTeX
- Gerth Stølting Brodal, Srinivasan Venkatesh:
Improved bounds for dictionary look-up with one error.
57-59
Electronic Edition (link) BibTeX
- Keh-Ning Chang, Shi-Chun Tsai:
Exact solution of a minimal recurrence.
61-64
Electronic Edition (link) BibTeX
- Krzysztof Giaro, Marek Kubale:
Edge-chromatic sum of trees and bounded cyclicity graphs.
65-69
Electronic Edition (link) BibTeX
- Toru Hasunuma:
On edge-disjoint spanning trees with small depths.
71-74
Electronic Edition (link) BibTeX
- Marek Chrobak, Jiri Sgall:
A simple analysis of the harmonic algorithm for two servers.
75-77
Electronic Edition (link) BibTeX
- Yaoyun Shi:
Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables.
79-83
Electronic Edition (link) BibTeX
- Poul Frederick Williams, Macha Nikolskaïa, Antoine Rauzy:
Bypassing BDD construction for reliability analysis.
85-89
Electronic Edition (link) BibTeX
Volume 75,
Number 3,
31 August 2000
- Ulrich Hertrampf, Steffen Reith, Heribert Vollmer:
A note on closure properties of logspace MOD classes.
91-93
Electronic Edition (link) BibTeX
- Sergei Bespamyatnikh, Michael Segal:
Covering a set of points by two axis-parallel boxes.
95-100
Electronic Edition (link) BibTeX
- P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani P. Roychowdhury, Farrokh Vatan:
A new universal and fault-tolerant quantum basis.
101-107
Electronic Edition (link) BibTeX
- Andris Ambainis:
How rich is the structure of the intrinsic complexity of learning.
109-112
Electronic Edition (link) BibTeX
- D. J. Guan, Chun-yen Chou, Chiou-Wei Chen:
Computational complexity of similarity retrieval in a pictorial database.
113-117
Electronic Edition (link) BibTeX
- Wolfgang Günther, Rolf Drechsler:
On the computational power of linearly transformed BDDs.
119-125
Electronic Edition (link) BibTeX
- Massimiliano Goldwurm, Massimo Santini:
Clique polynomials have a unique root of smallest modulus.
127-132
Electronic Edition (link) BibTeX
- Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger:
Approximation algorithms for the TSP with sharpened triangle inequality.
133-138
Electronic Edition (link) BibTeX
Volume 75,
Number 4,
30 September 2000
Volume 75,
Number 5,
31 October 2000
- Zichen Li, Lucas Chi Kwong Hui, K. P. Chow, C. F. Chong, Wai Wan Tsang, H. W. Chan:
Security of Tseng-Jan's group signature schemes.
187-189
Electronic Edition (link) BibTeX
- Eric Gamess:
plapackJava: Towards an efficient Java interface for high performance parallel linear algebra.
191-197
Electronic Edition (link) BibTeX
- Sherali Zeadally:
Performance evaluation of a Java-based networking Application Programming Interface (API).
199-209
Electronic Edition (link) BibTeX
- Andreu Riera, Josep Rifà, Joan Borrell:
Efficient construction of vote-tags to allow open objection to the tally in electronic elections.
211-215
Electronic Edition (link) BibTeX
- John A. Ellis, Tobias Krahn, Hongbing Fan:
Computing the cycles in the perfect shuffle permutation.
217-224
Electronic Edition (link) BibTeX
- Bang Ye Wu:
Polynomial time algorithms for some minimum latency problems.
225-229
Electronic Edition (link) BibTeX
- Frank K. Hwang, C. K. Pai:
Sequential construction of a circular consecutive-2 system.
231-235
Electronic Edition (link) BibTeX
Volume 75,
Number 6,
30 November 2000
Copyright © Sun May 17 00:04:05 2009
by Michael Ley (ley@uni-trier.de)
