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 YEAR=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
A new routing algorithm for cyclic shifts on BRGC hypercubes
Chien-Min Wang
Information Processing Letters
49
, 1994, pp. 165-169
A sweepline algorithm to solve the two-center problem
Nen-Fu Huang
,
Ching-Ho Huang
,
Yue-Li Wang
Information Processing Letters
49
, 1994, pp. 171-177
On bispecial factors of the Thue-Morse word
Aldo de Luca
,
Licia Mione
Information Processing Letters
49
, 1994, pp. 179-183
A note on the equivalence of a set of egds to a set of FDs
John H. Leuchner
,
Les Miller
,
Giora Slutzki
Information Processing Letters
49
, 1994, pp. 185-188
Eliminating disjunctions of leads-to properties
Ken Calvert
Information Processing Letters
49
, 1994, pp. 189-194
Distributed consensus revisited
Gil Neiger
Information Processing Letters
49
, 1994, pp. 195-201
Two-way dominant sequence clustering for processor scheduling
Dongseung Kim
,
Joonyoung Park
Information Processing Letters
49
, 1994, pp. 203-208
A faster algorithm for computing the strength of a network
Eddie Cheng
,
Willliam H. Cunningham
Information Processing Letters
49
, 1994, pp. 209-212
A distributed
k
-mutual exclusion algorithm using
k
-coterie
Hirotsugu Kakugawa
,
Satoshi Fujita
,
Masafumi Yamashita
,
Tadashi Ae
Information Processing Letters
49
, 1994, pp. 213-218
On using the Fourier transform to learn disjoint DNF
Roni Khardon
Information Processing Letters
49
, 1994, pp. 219-222
A note on bitonic sorting
Wolfgang J. Paul
Information Processing Letters
49
, 1994, pp. 223-225
Seiten
<
1
2
3
4
5
6
7
8
9
>