Volume 90,
Number 1,
15 April 2004
Volume 90,
Number 2,
30 April 2004
- Vicent Cholvi, Josep Bernabéu:
Relationships between memory models.
53-58
Electronic Edition (link) BibTeX
- Toshihiro Fujito, Takashi Doi:
A 2-approximation NC algorithm for connected vertex cover and tree cover.
59-63
Electronic Edition (link) BibTeX
- Ioannis N. Kouris, Christos Makris, Athanasios K. Tsakalidis:
Efficient automatic discovery of 'hot' itemsets.
65-72
Electronic Edition (link) BibTeX
- Abdullah AlWehaibi, Michel Kadoch, Anjali Agarwal, Ahmed K. Elhakeem:
Packet loss probability for DiffServ over IP and MPLS reliable homogeneous multicast networks.
73-80
Electronic Edition (link) BibTeX
- Hongfei Sui, Jianxin Wang, Jianer Chen, Songqiao Chen:
The cost of becoming anonymous: on the participant payload in Crowds.
81-86
Electronic Edition (link) BibTeX
- Eurípides Montagne, Anand Ekambaram:
An optimal storage format for sparse matrices.
87-92
Electronic Edition (link) BibTeX
- Ding Liu:
A note on point location in arrangements of hyperplanes.
93-95
Electronic Edition (link) BibTeX
- Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani:
A note on 3D orthogonal drawings with direction constrained edges.
97-101
Electronic Edition (link) BibTeX
Volume 90,
Number 3,
16 May 2004
Volume 90,
Number 4,
31 May 2004
- Ernst-Erich Doberkat:
Factoring stochastic relations.
161-166
Electronic Edition (link) BibTeX
- Valerio Freschi, Alessandro Bogliolo:
Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism.
167-173
Electronic Edition (link) BibTeX
- Francis Y. L. Chin, Alfredo De Santis, Anna Lisa Ferrara, N. L. Ho, S. K. Kim:
A simple algorithm for the constrained sequence problems.
175-179
Electronic Edition (link) BibTeX
- James F. Korsh, Paul LaFollette:
Constant time generation of derangements.
181-186
Electronic Edition (link) BibTeX
- Alexandros V. Gerbessiotis, Constantinos J. Siniolakis:
Probabilistic integer sorting.
187-193
Electronic Edition (link) BibTeX
- Harumichi Nishimura, Tomoyuki Yamakami:
Polynomial time quantum computation with advice.
195-204
Electronic Edition (link) BibTeX
- Nicholas J. A. Harvey, J. Ian Munro:
Deterministic SkipNet.
205-208
Electronic Edition (link) BibTeX
- Guy Melançon, Fabrice Philippe:
Generating connected acyclic digraphs uniformly at random.
209-213
Electronic Edition (link) BibTeX
Volume 90,
Number 5,
15 June 2004
- Jean-Loup Guillaume, Matthieu Latapy:
Bipartite structure of all complex networks.
215-221
Electronic Edition (link) BibTeX
- Mads Sig Ager, Olivier Danvy, Jan Midtgaard:
A functional correspondence between call-by-need evaluators and lazy abstract machines.
223-232
Electronic Edition (link) BibTeX
- David P. Bunde:
SPT is optimally competitive for uniprocessor flow.
233-238
Electronic Edition (link) BibTeX
- Petra Sparl, Janez Zerovnik:
2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs.
239-246
Electronic Edition (link) BibTeX
- Richard Parker, Andrew Plater:
Addition chains with a bounded number of registers.
247-252
Electronic Edition (link) BibTeX
- Sang-Wook Kim, Dae-Hyun Park, Heon-Gil Lee:
Efficient processing of subsequence matching with the Euclidean metric in time-series databases.
253-260
Electronic Edition (link) BibTeX
- Carme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna:
The complexity of deciding stability under FFS in the Adversarial Queueing model.
261-266
Electronic Edition (link) BibTeX
- Mark Weston:
A fixed-parameter tractable algorithm for matrix domination.
267-272
Electronic Edition (link) BibTeX
Volume 90,
Number 6,
30 June 2004
Copyright © Tue May 27 18:28:27 2008
by Michael Ley (ley@uni-trier.de)
