Volume 69,
Number 1,
15 January 1999
Volume 69,
Number 2,
29 January 1999
- Guo-Hui Lin, Guoliang Xue:
Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length.
53-57
Electronic Edition (link) BibTeX
- Henning Bordihn, Markus Holzer:
On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems.
59-62
Electronic Edition (link) BibTeX
- Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree.
63-67
Electronic Edition (link) BibTeX
- Ju-Hong Lee, Guang-Ho Cha, Chin-Wan Chung:
A Model for k-Nearest Neighbor Query Processing Cost in Multidimensional Data Space.
69-76
Electronic Edition (link) BibTeX
- S. R. Chauhan, Iain A. Stewart:
On the Power of Built-In Relations in Certain Classes of Program Schemes.
77-82
Electronic Edition (link) BibTeX
- Marius Zimand:
Relative to a Random Oracle, P/Poly is not Measurable in EXP.
83-86
Electronic Edition (link) BibTeX
- Chin-Wen Ho, Jou-Ming Chang:
Solving the All-Pairs-Shortest-Lengt Problem on Chordal Bipartite Graphs.
87-93
Electronic Edition (link) BibTeX
- Chih-Hung Wang, Tzonelih Hwang, Narn-Yih Lee:
Comments on Two Group Signatures.
95-97
Electronic Edition (link) BibTeX
- Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. Levitin, Dimiter R. Avresky:
On the Covering of Vertices for Fault Diagnosis in Hypercubes.
99-103
Electronic Edition (link) BibTeX
Volume 69,
Number 3,
12 February 1999
- Pierre Crégut, Barbara Heyd:
Progress Properties for Empty UNITY Programs.
107-109
Electronic Edition (link) BibTeX
- Zheng Wang:
On the Complexity of Quality of Service Routing.
111-114
Electronic Edition (link) BibTeX
- Yongge Wang:
A Separation of Two Randomness Concepts.
115-118
Electronic Edition (link) BibTeX
- Hong-Chung Chen, Yue-Li Wang, Yu-Feng Lan:
A Memory-Efficient and Fast Huffman Decoding Algorithm.
119-122
Electronic Edition (link) BibTeX
- Dominique Roelants van Baronaigien:
A Multi-Stack Method for the Fast Generation of Permutations with Minimal Length Increasing Subsequences.
123-126
Electronic Edition (link) BibTeX
- Leizhen Cai, Yin-Feng Xu, Binhai Zhu:
Computing the Optimal Bridge Between Two Convex Polygons.
127-130
Electronic Edition (link) BibTeX
- Douglas R. Stinson, Ruizhong Wei:
An Application of Ramp Schemes to Broadcast Encryption.
131-135
Electronic Edition (link) BibTeX
- Rajeev Alur, Doron Peled:
Undecidability of Partial Order Logics.
137-143
Electronic Edition (link) BibTeX
- Jovan Dj. Golic:
Stream Cipher Encryption of Random Access Files.
145-148
Electronic Edition (link) BibTeX
- Igor Terekhov, Tracy Camp:
Time Efficient Deadlock Resolution Algorithms.
149-154
Electronic Edition (link) BibTeX
- Yukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi:
Independent Spanning Trees of Chordal Rings.
155-160
Electronic Edition (link) BibTeX
Volume 69,
Number 4,
26 February 1999
- Noriko Sugimoto, Hiroki Ishizaka:
Generating Languages by a Derivation Procedure for Elementary Formal Systems.
161-166
Electronic Edition (link) BibTeX
- Jin-yi Cai:
A Classification of the Probabilistic Polynomial Time Hierarchy Under Fault Tolerant Access to Oracle Classes.
167-174
Electronic Edition (link) BibTeX
- Carsten Damm:
Depth-Efficient Simulation of Boolean Semi-Unbounded Circuits by Arithmetic Ones.
175-179
Electronic Edition (link) BibTeX
- Vikraman Arvind, Jacobo Torán:
Sparse Sets, Approximable Sets, and Parallel Queries to NP.
181-188
Electronic Edition (link) BibTeX
- Gabriel Robins, Brian L. Robinson, Bhupinder S. Sethi:
On Detecting Spatial Regularity in Noisy Images.
189-195
Electronic Edition (link) BibTeX
- A. Arvind, C. Pandu Rangan:
Symmetric Min-Max Heap: A Simpler Data Structure for Double-Ended Priority Queue.
197-199
Electronic Edition (link) BibTeX
- Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano:
The Graph Clustering Problem has a Perfect Zero-Knowledge Interactive Proof.
201-206
Electronic Edition (link) BibTeX
- V. A. Nepomniaschy:
Symbolic Verification Method for Definite Iteration over Data Structures.
207-213
Electronic Edition (link) BibTeX
Volume 69,
Number 5,
12 March 1999
- Oswin Aichholzer, Franz Aurenhammer, Reinhard Hainz:
New Results on MWT Subgraphs.
215-219
Electronic Edition (link) BibTeX
- Pierre-Yves Schobbens, Jean-François Raskin:
The Logic of ``Initially'' and ``Next'': Complete Axiomatization and Complexity.
221-225
Electronic Edition (link) BibTeX
- L. Javier García-Villalba, Amparo Fúster-Sabater:
On the General Classification of Nonlinear Filters of m-Sequences.
227-232
Electronic Edition (link) BibTeX
- Masaaki Mizuno:
A Structured Approach for Developing Concurrent Programs in Java.
233-238
Electronic Edition (link) BibTeX
- Joseph Cheriyan, Kurt Mehlhorn:
An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow.
239-242
Electronic Edition (link) BibTeX
- Kuo-Qin Yan, Shu-Chin Wang, Yeh-Hao Chin:
Consensus Under Unreliable Transmission.
243-248
Electronic Edition (link) BibTeX
- Damu Radhakrishnan, A. P. Preethy:
A Parallel Approach to Direct Analog-to-Residue Conversion.
249-252
Electronic Edition (link) BibTeX
- Marco A. Torres, Susumu Kuroyanagi, Akira Iwata:
The Self-Indexed Search Algorithm: A Bit-Level Approach to Minimal Perfect Hashing.
253-258
Electronic Edition (link) BibTeX
- Nader H. Bshouty, Lisa Higham, Jolanta Warpechowska-Gruca:
Meeting Times of Random Walks on Graphs.
259-265
Electronic Edition (link) BibTeX
Volume 69,
Number 6,
26 March 1999
Copyright © Sun May 17 00:04:05 2009
by Michael Ley (ley@uni-trier.de)
