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=49
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Distributed termination detection in reducible communication graphs
Vittoria Gianuzzi
Information Processing Letters
49
, 1994, pp. 1-8
On finding the strongly connected components in a directed graph
Esko Nuutila
,
Eljas Soisalon-Soininen
Information Processing Letters
49
, 1994, pp. 9-14
On average time hierarchies
Mikael Goldmann
,
Per Grape
,
Johan Håstad
Information Processing Letters
49
, 1994, pp. 15-20
A shortest-path algorithm for Manhattan graphs
Kanchana Kanchanasut
Information Processing Letters
49
, 1994, pp. 21-25
On generating B-trees with constant average delay and in lexicographic order
Mounir Belbaraka
,
Ivan Stojmenović
Information Processing Letters
49
, 1994, pp. 27-32
Computing values of a polynomial with only few multiplications
D. Veljan
Information Processing Letters
49
, 1994, pp. 33-37
A randomized algorithm for finding maximum with
O((\log n)^2)
polynomial tests
Hing F. Ting
,
Andrew C. Yao
Information Processing Letters
49
, 1994, pp. 39-43
Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
C. Rhee
,
Y. Daniel Liang
,
S.K. Dhall
,
S. Lakshmivarahan
Information Processing Letters
49
, 1994, pp. 45-50
The domatic number problem on some perfect graph families
Haim Kaplan
,
Ron Shamir
Information Processing Letters
49
, 1994, pp. 51-56
Real-time leader election
Gurdip Singh
Information Processing Letters
49
, 1994, pp. 57-61
An efficient computation of right context for LR-based error repair
Min-Soo Jung
,
Kwang-Moo Choe
,
Taisook Han
Information Processing Letters
49
, 1994, pp. 63-71
Two-coloring linked lists is
NC^1
-complete for logarithmic space
Sanjeev Saxena
Information Processing Letters
49
, 1994, pp. 73-76
Tight bounds on expected time to add correctly and add mostly correctly
Peter Gemmell
,
Mor Harchol
Information Processing Letters
49
, 1994, pp. 77-83
Generating polynomial orderings
Joachim Steinbach
Information Processing Letters
49
, 1994, pp. 85-93
Generating words in a context-free language uniformly at random
Harry G. Mairson
Information Processing Letters
49
, 1994, pp. 95-99
Modularity of confluence: A simplified proof
Jan Willem Klop
,
Aart Middeldorp
,
Yoshihito Toyama
,
Roel de Vrijer
Information Processing Letters
49
, 1994, pp. 101-109
Alphabet dependence in parameterized matching
Amihood Amir
,
Martin Farach
,
S. Muthukrishnan
Information Processing Letters
49
, 1994, pp. 111-115
The range co-minima problem
Sung Kwon Kim
Information Processing Letters
49
, 1994, pp. 117-121
Notes on looping deterministic two-way pushdown automata
M. Ladermann
,
H. Petersen
Information Processing Letters
49
, 1994, pp. 123-127
An algorithm to estimate the fraction defective and the exponential mean life using unlabeled samples
Tze Fen Li
,
Sung Wu Chang
Information Processing Letters
49
, 1994, pp. 129-133
Counting closed walks in generalized de Bruijn graphs
Yukio Shibata
,
Miyuki Shirahata
,
Shingo Osawa
Information Processing Letters
49
, 1994, pp. 135-138
Recognition algorithm for intersection graphs of edge disjoint paths in a tree
B.S. Panda
,
S.P. Mohanty
Information Processing Letters
49
, 1994, pp. 139-143
Fault tolerance of the star graph interconnection network
Zoran Jovanović
,
Jelena Mis̑ić
Information Processing Letters
49
, 1994, pp. 145-150
Size-depth tradeoffs for Boolean formulae
Maria Luisa Bonet
,
Samuel R. Buss
Information Processing Letters
49
, 1994, pp. 151-155
A processor efficient MIS algorithm on random graphs
S.B. Yang
,
S.K. Dhall
,
S. Lakshmivarahan
Information Processing Letters
49
, 1994, pp. 157-163
Seiten 1
2
3
>