Volume 50,
Number 1,
8 April 1994
- Ferruccio Barsi, Maria Cristina Pinotti:
A Fully Parallel Algorithm for Residue to Binary Conversion.
1-8 BibTeX
- Yossi Azar, Andrei Z. Broder, Alan M. Frieze:
On the Problem of Approximating the Number of Bases of a Matroid.
9-11 BibTeX
- Yi-Bing Lin:
Determining the Global Progress of Parallel Simulation with FIFO Communication Property.
13-17 BibTeX
- Marc Demange, Pascal Grisoni, Vangelis Th. Paschos:
Approximation Results for the Minimum Graph Coloring Problem.
19-23 BibTeX
- Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena:
Efficient Management of Dynamic Tables.
25-30 BibTeX
- Pierre Collette:
An Explanatory Presentation of Composition Rules for Assumption-Commitment Specifications.
31-35 BibTeX
- Jennifer Seberry, Xian-Mo Zhang, Yuliang Zheng:
Improving the Strict Avalanche Characteristics of Cryptographic Functions.
37-41 BibTeX
- Yong-Seok Kim:
An Optimal Scheduling Algorithm for Preemptable Real-Time Tasks.
43-38 BibTeX
- Samir Khuller, Balaji Raghavachari, Neal E. Young:
Designing Multi-Commodity Flow Trees.
49-55 BibTeX
Volume 50,
Number 2,
April 1994
- Frédéric Maire:
Polyominos and Perfect Graphs.
57-61 BibTeX
- Paolo Ferragina:
Static and Dynamic Parallel Computation of Connected Components.
63-68 BibTeX
- Her-Kun Chang, Shyan-Ming Yuan:
Message Complexity of Hierarchical Quorum Consensus Algorithm.
69-73 BibTeX
- T. Sony Roy, G. Athithan, M. S. Ganagi, A. Sivasankara Reddy:
A New Method to Solve Non-Linear Equations.
75-79 BibTeX
- Narsingh Deo, Amit Jain, Muralidhar Medidi:
An Optimal Parallel Algorithm for Merging Using Multiselection.
81-87 BibTeX
- Y. L. Chen:
Finding the k Quickset Simple Paths in a Network.
89-92 BibTeX
- Giovanni Di Crescenzo, Giuseppe Persiano:
Round-Optimal Perfect Zero-Knowledge Proofs.
93-99 BibTeX
- Rani Siromoney, Lisa Mathew, V. Rajkumar Dare, K. G. Subramanian:
Infinite Lyndon Words.
101-104 BibTeX
- Rahul Simha, Amitava Majumdar:
On Lookahead in the List Update Problem.
105-110 BibTeX
- Himabindu Gurla:
Corrigendum: Leftmost one Computation on Meshes with Row Broadcasting.
111 BibTeX
Volume 50,
Number 3,
9 May 1994
- Yair Bartal, Howard J. Karloff, Yuval Rabani:
A Better Lower Bound for On-Line Scheduling.
113-116 BibTeX
- Etsuro Moriya:
On Two-Way Tree Automata.
117-121 BibTeX
- Paul F. Dietz, Ioan I. Macarie, Joel I. Seiferas:
Bits and Relative Order From Residues, Space Efficiently.
123-127 BibTeX
- Dongseung Kim, Seung-Hoon Kim:
O(log n) Numerical Algorithms on a Mesh with Wormhole Routing.
129-136 BibTeX
- Bob P. Weems, Lloyd C. Swayze:
Allocation Techniques for Distributed Reduction Data Elements.
137-142 BibTeX
- Yuzheng Ding, Mark Allen Weiss:
On the Complexity of Building an Interval Heap.
143-144 BibTeX
- G. Prem Kumar, G. Phanendra Babu:
Optimal Network Partitioning for Fault-Tolerant Network Management Using Evolutionary Programming.
145-149 BibTeX
- Dhananjay M. Dhamdhere, Sandeep S. Kulkarni:
A Token Based k-Resilient Mutual Exclusion Algorithm for Distributed Systems.
151-157 BibTeX
- Li-Yan Yuan:
Logic Program Semantics and Circumscription of Autoepistemic Theories.
159-164 BibTeX
- Roberto Baldoni, Bruno Ciciani:
Distributed Algorithms for Multiple Entries to a Critical Section with Priority.
165-172 BibTeX
Volume 50,
Number 4,
25 May 1994
Volume 50,
Number 5,
10 June 1994
Volume 50,
Number 6,
27 June 1994
Copyright © Sun May 17 00:04:02 2009
by Michael Ley (ley@uni-trier.de)
