Volume 85,
Number 1,
16 January 2003
- Dimitris J. Kavvadias, Elias C. Stavropoulos:
Monotone Boolean dualization is in co-NP[log2n].
1-6
- Jun-Ki Min, Jae-Yong Ahn, Chin-Wan Chung:
Efficient extraction of schemas for XML documents.
7-12
- Wilfried Meidl, Arne Winterhof:
On the linear complexity profile of explicit nonlinear pseudorandom numbers.
13-18
- Elvira Albert, Michael Hanus, Germán Vidal:
A residualizing semantics for the partial evaluation of functional logic programs.
19-25
- Cheng-Yuan Ku, Din-Yuen Chan, Lain-Chyr Hwang:
Optimal reservation policy for two queues in tandem.
27-30
- Jae-Hoon Kim, Kyung-Yong Chwa:
Online deadline scheduling on faster machines.
31-37
- Edgar Chávez, Gonzalo Navarro:
Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.
39-46
- Idit Keidar, Sergio Rajsbaum:
A simple proof of the uniform consensus synchronous lower bound.
47-52
- Francis Y. L. Chin, Fu Lee Wang:
Erratum to: "Efficient algorithm for transversal of disjoint convex polygons".
53
- Francis Y. L. Chin, Hong Shen, Fu Lee Wang:
Transversal of disjoint convex polygons.
55-60
Volume 85,
Number 2,
31 January 2003
- Gwénaël Richomme:
Some non finitely generated monoids of repetition-free endomorphisms.
61-66
- Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev:
On-line restricted assignment of temporary tasks with unknown durations.
67-72
- Marianne Durand:
Asymptotic analysis of an optimized quicksort algorithm.
73-77
- K. Vidyasankar:
A simple group mutual l-exclusion algorithm.
79-85
- Antoine Vigneron:
Reporting intersections among thick objects.
87-92
- Jong Min Kim, Donghee Lee, Sam H. Noh, Sang Lyul Min, Yookun Cho, Chong-Sang Kim:
An accurate and practical buffer allocation model for the buffer cache based on marginal gains.
93-97
- Chin-Chen Chang, Chi-Yien Chung:
An efficient protocol for anonymous multicast and reception.
99-103
- Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair:
Parametric analysis of overall min-cuts and applications in undirected networks.
105-109
- Amparo Fúster-Sabater, Pedro García-Mochales:
On the balancedness of nonlinear generators of binary sequences.
111-116
Volume 85,
Number 3,
14 February 2003
Volume 85,
Number 4,
28 February 2003
- Deshi Ye, Guochuan Zhang:
On-line scheduling with extendable working time on a small number of machines.
171-177
- Gennady Pustylnik, Micha Sharir:
The Minkowski sum of a simple polygon and a segment.
179-184
- Chang-Chun Lu, Shi-Chun Tsai:
A note on unscrambling address lines.
185-189
- Takashi Horiyama, Toshihide Ibaraki:
Translation among CNFs, characteristic models and ordered binary decision diagrams.
191-198
- Satoshi Fujita:
On-line grid-packing with a single active grid.
199-204
- Po-Hsueh Huang, Yin-Te Tsai, Chuan Yi Tang:
A fast algorithm for the alpha-connected two-center decision problem.
205-210
- Doratha E. Drake, Stefan Hougardy:
A simple approximation algorithm for the weighted matching problem.
211-213
- Jong Ha Ko, Sang-Hee Kim, Jong-Kyu Lee:
An ENA algorithm to enhance the performance of TCP over satellite links.
215-219
- Jurriaan Hage:
Enumerating submultisets of multisets.
221-226
Volume 85,
Number 5,
16 March 2003
- Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
On special families of morphisms related to [delta]-matching and don't care symbols.
227-233
- Jean Marcel Pallo:
Generating binary trees by Glivenko classes on Tamari lattices.
235-238
- Ferdinando Cicalese, Ugo Vaccaro:
Binary search with delayed and missing answers.
239-247
- Jan Poland:
Finding smooth maps is NP-complete.
249-253
- Jayadev Misra:
Derivation of a parallel string matching algorithm.
255-260
- Guillaume Fertin, André Raspaud, Arup Roychowdhury:
On the oriented chromatic number of grids.
261-266
- Ming Li, John Tromp, Paul M. B. Vitányi:
Sharpening Occam's razor.
267-274
- Desh Ranjan, Enrico Pontelli:
The Level-Ancestor problem on Pure Pointer Machines.
275-283
Volume 85,
Number 6,
31 March 2003
Copyright © Mon Nov 30 20:28:17 2009
by Michael Ley (ley@uni-trier.de)
