Volume 73,
Numbers 1-2,
31 January 2000
- Erkki Mäkinen:
On inferring linear single-tree languages.
1-3
Electronic Edition (link) BibTeX
- Eddie Cheng, Marc J. Lipman:
On the Day-Tripathi orientation of the star graphs: Connectivity.
5-10
Electronic Edition (link) BibTeX
- Jorge Castro, David Guijarro:
PACS, simple-PAC and query learning.
11-16
Electronic Edition (link) BibTeX
- Michael A. Bender, Chandra Chekuri:
Performance guarantees for the TSP with a parameterized triangle inequality.
17-21
Electronic Edition (link) BibTeX
- Mikael Goldmann, Alexander Russell, Denis Thérien:
An ergodic theorem for read-once non-uniform deterministic finite automata.
23-28
Electronic Edition (link) BibTeX
- Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman:
Low discrepancy sets yield approximate min-wise independent permutation families.
29-32
Electronic Edition (link) BibTeX
- Sung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang:
Placing two disks in a convex polygon.
33-39
Electronic Edition (link) BibTeX
- Ted Herman, Sriram V. Pemmaraju:
Error-detecting codes and fault-containing self-stabilization.
41-46
Electronic Edition (link) BibTeX
- Vladimir Pestov:
On the geometry of similarity search: Dimensionality curse and concentration of measure.
47-51
Electronic Edition (link) BibTeX
- Enno Ohlebusch:
A uniform framework for term and graph rewriting applied to combined systems.
53-59
Electronic Edition (link) BibTeX
- Giorgio Gambosi, Gaia Nicosia:
On-line scheduling with setup costs.
61-68
Electronic Edition (link) BibTeX
- Uriel Feige, Joe Kilian:
Finding OR in a noisy broadcast network.
69-75
Electronic Edition (link) BibTeX
Volume 73,
Numbers 3-4,
29 February 2000
Volume 73,
Numbers 5-6,
31 March 2000
- Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg:
Pancyclicity in switching classes.
153-156
Electronic Edition (link) BibTeX
- Raymond R. Devillers, Joël Goossens:
Liu and Layland's schedulability test revisited.
157-161
Electronic Edition (link) BibTeX
- Atsushi Kaneko, Kiyoshi Yoshimoto:
On spanning trees with restricted degrees.
163-165
Electronic Edition (link) BibTeX
- Liang Chen, Naoyuki Tokuda:
A note on "Category and measure in complexity classes".
167-168
Electronic Edition (link) BibTeX
- Steven McKellar, Robert Davis:
Redundancy removal in multicast protocols.
169-173
Electronic Edition (link) BibTeX
- Zoltán Fülöp, Sebastian Maneth:
Domains of partial attributed tree transducers.
175-180
Electronic Edition (link) BibTeX
- Fanica Gavril:
Maximum weight independent sets and cliques in intersection graphs of filaments.
181-188
Electronic Edition (link) BibTeX
- Giovanni Dimauro, Sebastiano Impedovo, Giuseppe Pirlo, A. Salzo:
RNS architectures for the implementation of the `diagonal function'.
189-198
Electronic Edition (link) BibTeX
- Amiya Nayak, J. Ren, Nicola Santoro:
An improved testing scheme for catastrophic fault patterns.
199-206
Electronic Edition (link) BibTeX
- Achour Mostéfaoui, Michel Raynal, Frederic Tronel:
From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems.
207-212
Electronic Edition (link) BibTeX
- Amos Beimel, Eyal Kushilevitz:
Learning unions of high-dimensional boxes over the reals.
213-220
Electronic Edition (link) BibTeX
- Daniel Stefankovic:
Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms.
221-225
Electronic Edition (link) BibTeX
Copyright © Wed Jun 4 19:12:18 2008
by Michael Ley (ley@uni-trier.de)
