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=54
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constant-time parallel recognition of split graphs
Stavros D. Nikolopoulos
Information Processing Letters
54
, 1995, pp. 1-8
On space functions fully constructed by two-dimensional Turing machines
H. Petersen
Information Processing Letters
54
, 1995, pp. 9-10
A Markov model for multibus multiprocessor systems under asynchronous operation
Hamed Nassar
Information Processing Letters
54
, 1995, pp. 11-16
On modal mu-calculus and Büchi tree automata
Roope Kaivola
Information Processing Letters
54
, 1995, pp. 17-22
Multiprocessor simulation strategies with optimal speed-up
Paul E. Dunne
,
Chris J. Gittings
,
Paul H. Leng
Information Processing Letters
54
, 1995, pp. 23-33
Quasi-parity and perfect graphs
Irena Rusu
Information Processing Letters
54
, 1995, pp. 35-39
On helping by parity-like languages
Mitsunori Ogihara
Information Processing Letters
54
, 1995, pp. 41-43
\lambda_{\beta'}
- A
\lambda
-calculus with a generalized
\beta
-reduction rule
Sundeep Oberoi
Information Processing Letters
54
, 1995, pp. 45-53
On finding a cycle basis with a shortest maximal cycle
David M. Chickering
,
Dan Geiger
,
David Heckerman
Information Processing Letters
54
, 1995, pp. 55-58
Linear-time optimal augmentation for componentwise bipartite-completeness of graphs
Ming-Yang Kao
Information Processing Letters
54
, 1995, pp. 59-63
Partial functions and logics: A warning
C.B. Jones
Information Processing Letters
54
, 1995, pp. 65-67
Compact embedding of binary trees into hypercubes
Chui-Cheng Chen
,
Rong-Jaye Chen
Information Processing Letters
54
, 1995, pp. 69-72
Local search, reducibility and approximability of NP-optimization problems
Giorgio Ausiello
,
Marco Protasi
Information Processing Letters
54
, 1995, pp. 73-79
Lazy update: An efficient implementation of LRU stacks
Luis Barriga
,
Rassul Ayani
Information Processing Letters
54
, 1995, pp. 81-84
Approximately matching context-free languages
Gene Myers
Information Processing Letters
54
, 1995, pp. 85-92
An improved algorithm for computing the edit distance of run-length coded strings
H. Bunke
,
J. Csirik
Information Processing Letters
54
, 1995, pp. 93-96
Weighted search in the plane
Richa Agarwala
,
David Fernández-Baca
Information Processing Letters
54
, 1995, pp. 97-100
A correction to ``An optimal algorithm to compute all the covers of a string''
Dennis Moore
,
W.F. Smyth
Information Processing Letters
54
, 1995, pp. 101-103
On the index of positive programmed formal languages
Guozhu Dong
Information Processing Letters
54
, 1995, pp. 105-110
Message terminating algorithms for anonymous rings of unknown size
Israel Cidon
,
Yuval Shavitt
Information Processing Letters
54
, 1995, pp. 111-119
Deriving global virtual time algorithms from conservative simulation protocols
George Varghese
,
Roger Chamberlain
,
William E. Weihl
Information Processing Letters
54
, 1995, pp. 121-126
A note on consruction of treaps and Cartesian trees
M.A. Weiss
Information Processing Letters
54
, 1995, pp. 127-127
A simple LP-free approximation algorithm for the minimum weight vertex cover problem
Teofilo F. Gonzalez
Information Processing Letters
54
, 1995, pp. 129-131
On finding solutions for extended Horn formulas
John S. Schlipf
,
Fred S. Annexstein
,
John V. Franco
,
R.P. Swaminathan
Information Processing Letters
54
, 1995, pp. 133-137
Efficient management of multiple outstanding timeouts
Guillermo A. Alvarez
,
Marcelo O. Fernández
Information Processing Letters
54
, 1995, pp. 139-145
Seiten 1
2
3
>