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=55
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A fast and efficient NC algorithm for maximal matching
Zhi-Zhong Chen
Information Processing Letters
55
, 1995, pp. 303-307
Metric graphs elastically embeddable in the plane
J. Nievergelt
,
Narsingh Deo
Information Processing Letters
55
, 1995, pp. 309-315
Utility of pathmax in partial order heuristic search
Pallab Dasgupta
,
P.P. Chakrabarti
,
S.C. DeSarkar
Information Processing Letters
55
, 1995, pp. 317-322
Unification of kinded infinite trees
Vasco Thudichum Vasconcelos
Information Processing Letters
55
, 1995, pp. 323-328
Balanced allocations for tree-like inputs
Andrei Z. Broder
,
Alan Frieze
,
Carsten Lund
,
Steven Phillips
,
Nick Reingold
Information Processing Letters
55
, 1995, pp. 329-332
Fast parallel algorithms for the approximate edge-coloring problem
Weifa Liang
Information Processing Letters
55
, 1995, pp. 333-338
A note on isomorphic chordal rings
Amiya Nayak
,
Vincenzo Accia
,
Paolo Gissi
Information Processing Letters
55
, 1995, pp. 339-341
Order-of-demand analysis for lazy languages
Young G. Park
,
Benjamin Goldberg
Information Processing Letters
55
, 1995, pp. 343-348
LR
(k)
-coupled-context-free grammars
Gisela Pitsch
Information Processing Letters
55
, 1995, pp. 349-358
Seiten
<
1
2
3