Volume 51,
Number 1,
12 July 1994
- Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Bernard Mans, Andrzej Pelc:
Optimal Coteries and Voting Schemes.
1-6
- Meena Mahajan, Thomas Thierauf, N. V. Vinodchandran:
A Note on SpanP Functions.
7-10
- Zhaofang Wen:
New Algorithms for the LCA Problem and the Binary Tree Reconstruction Problem.
11-16
- Shuji Jimbo, Akira Maruoka:
On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables.
17-23
- Ling Chen, Henry Y. H. Chuang:
A Fast Algorithm for Euclidean Distance Maps of a 2-D Binary Image.
25-29
- Joseph Gil, Yossi Matias:
Designing Algorithms by Expectations.
31-34
- Yoshihide Igarashi, Shingo Osawa, Walter Unger:
Automorphisms of Broadcasting Schemes with Respect to Start Rounds.
35-41
- Antonia Sinachopoulos:
Logics and Decidability for Labelled Pre- and Partially Ordered Kripke Structures.
43-52
- Dan Halperin, Micha Sharir:
On Disjoint Concave Chains in Arrangements of (Pseudo) Lines.
53-56
Volume 51,
Number 2,
26 July 1994
Volume 51,
Number 3,
10 August 1994
- Mark Jerrum:
Counting Trees in a Graph is #P-Complete.
111-116
- Erl-Huei Lu, Yi-Chang Chen, Hsiao-Peng Wuu:
A Complete Decoding Algorithm for Double-Error-Correcting Primitive Binary BCH Codes of Odd m.
117-120 ,
Corrigendum: Inf. Process. Lett. 52(6): 341(1994)
- K. S. Easwarakumar, C. Pandu Rangan, Grant A. Cheston:
A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph.
121-124
- Bapiraju Vinnakota, V. V. Bapeswara Rao:
Enumeration of Binary Trees.
125-127
- Wen-Chin Chen, Wen-Chun Ni:
Internal Path Length of the Binary Representation of Heap-Ordered Trees.
129-132
- Refael Hassin, Shlomi Rubinstein:
Approximations for the Maximum Acyclic Subgraph Problem.
133-140
- Vladimir G. Deineko, René van Dal, Günter Rote:
The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case.
141-148
- Jayme Luiz Szwarcfiter, Guy Chaty:
Enumerating the Kernels of a Directed Graph with no Odd Circuits.
149-153
- G. Ramalingam, Thomas W. Reps:
On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem.
155-161
Volume 51,
Number 4,
24 August 1994
- Ching Yu Hung, Behrooz Parhami:
Fast RNS Division Algorithms for Fixed Divisors with Application to RSA Encrytion.
163-169
- André Raspaud, Eric Sopena:
Good and Semi-Strong Colorings of Oriented Planar Graphs.
171-174
- Dominique Barth, André Raspaud:
Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph.
175-179
- K. Sridharan, Harry E. Stephanou, K. C. Craig, S. Sathiya Keerthi:
Distance Measures on Intersecting Objects and Their Applications.
181-188
- Paul Fischer, Klaus-Uwe Höffgen:
Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon.
189-193
- Peng Chen, Shigeru Masuyama:
On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph.
195-199
- Robert Harper:
A Simplified Account of Polymorphic References.
201-206
- David Eppstein:
Arboricity and Bipartite Subgraph Listing Algorithms.
207-211
- Xiao-Dong Hu, P. D. Chen, Frank K. Hwang:
A New Competitive Algorithm for the Counterfeit Coin Problem.
213-218
Volume 51, Number 5, 12 September 1994
Volume 51,
Number 6,
26 September 1994
Copyright © Wed Nov 11 05:19:57 2009
by Michael Ley (ley@uni-trier.de)
