Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=39
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient deduction in equality Horn logic by Horn-completion
Robert Nieuwenhuis
,
Pilar Nivela
Information Processing Letters
39
, 1991, pp. 1-6
On random oracle separations
Ronald V. Book
Information Processing Letters
39
, 1991, pp. 7-10
Concerning the size of logical clocks in distributed systems
Bernadette Charron-Bost
Information Processing Letters
39
, 1991, pp. 11-16
Optimal superprimitivity testing for strings
Alberto Apostolico
,
Martin Farach
,
Costas S. Iliopoulos
Information Processing Letters
39
, 1991, pp. 17-20
An NL hierarchy
Jianer Chen
,
Jim Cox
,
Bud Mishra
Information Processing Letters
39
, 1991, pp. 21-26
Axiomatic semantics for ``escape'' statements
Ronald A. Olsson
,
Daniel T. Huang
Information Processing Letters
39
, 1991, pp. 27-33
Lower bounds for planar orthogonal drawings of graphs
Roberto Tamassia
,
Ioannis G. Tollis
,
Jeffrey Scott Vitter
Information Processing Letters
39
, 1991, pp. 35-40
Broadcasting in the butterfly network
Elena Stöhr
Information Processing Letters
39
, 1991, pp. 41-43
Proving correctness with respect to nondeterministic safety specifications
A.P. Sistla
Information Processing Letters
39
, 1991, pp. 45-49
An efficient algorithm for some tree matching problems
Fabrizio Luccio
,
Linda Pagli
Information Processing Letters
39
, 1991, pp. 51-57
Achieving optimal CRCW PRAM fault-tolerance
Alex A. Shvartsman
Information Processing Letters
39
, 1991, pp. 59-66
Private vs.\ common random bits in communication complexity
Ilan Newman
Information Processing Letters
39
, 1991, pp. 67-71
Fast one's-complement multiplication
Amos Omondi
Information Processing Letters
39
, 1991, pp. 73-79
A note on the subtree isomorphism for ordered trees and related problems
Roberto Grossi
Information Processing Letters
39
, 1991, pp. 81-84
A competitive 2-server algorithm
Sandy Irani
,
Ronitt Rubinfeld
Information Processing Letters
39
, 1991, pp. 85-91
Fault-tolerant parallel
k
selection algorithm in
n
-cube networks
Jang-Ping Sheu
Information Processing Letters
39
, 1991, pp. 93-97
Parallel Boolean operations for information retrieval
Abdulla Bataineh
,
Füsün özgüner
,
Alok Sarwal
Information Processing Letters
39
, 1991, pp. 99-108
Compositionality and bisimulation: A negative result
Alessandro Fantechi
,
Stefania Gnesi
,
Gioia Ristori
Information Processing Letters
39
, 1991, pp. 109-114
Broadcasting in a hypercube when some calls fail
Pierre Fraigniaud
,
Claudine Peyrat
Information Processing Letters
39
, 1991, pp. 115-119
A simple algorithm for determining the envelope of a set of lines
M. Keil
Information Processing Letters
39
, 1991, pp. 121-124
Decomposing a star graph into disjoint cycles
K. Qiu
,
H. Meijer
,
S. Akl
Information Processing Letters
39
, 1991, pp. 125-129
Stable set and multiset operations in optimal time and space
Bing-Chao Huang
,
Michael A. Langston
Information Processing Letters
39
, 1991, pp. 131-136
The Vapnik-Chervonenkis dimension of decision trees with bounded rank
Hans Ulrich Simon
Information Processing Letters
39
, 1991, pp. 137-141
Linear-size constant-depth polylog-threshold circuits
Prabhakar Ragde
,
Avi Wigderson
Information Processing Letters
39
, 1991, pp. 143-146
A self-stabilizing algorithm for constructing spanning trees
Nian-Shing Chen
,
Hwey-Pyng Yu
,
Shing-Tsaan Huang
Information Processing Letters
39
, 1991, pp. 147-151
Seiten 1
2
3
>