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=31
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A tight amortized bound for path reversal
David Ginat
,
Daniel D. Sleator
,
Robert E. Tarjan
Information Processing Letters
31
, 1989, pp. 3-5
An algorithm for drawing general undirected graphs
Tomihisa Kamada
,
Satoru Kawai
Information Processing Letters
31
, 1989, pp. 7-15
A linear time algorithm for finding all farthest neighbors in a convex polygon
Alok Aggarwal
,
Dina Kravets
Information Processing Letters
31
, 1989, pp. 17-20
Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors
Yves Robert
,
Bernard Tourancheau
,
Gilles Villard
Information Processing Letters
31
, 1989, pp. 21-29
Drawing polygons given angle sequences
Richard I. Hartley
Information Processing Letters
31
, 1989, pp. 31-33
Concurrency control on extendible hashing
Vijay Kumar
Information Processing Letters
31
, 1989, pp. 35-41
Welsh-Powell opposition graphs
S. Olariu
,
J. Randall
Information Processing Letters
31
, 1989, pp. 43-46
A pumping lemma for deterministic context-free languages
Sheng Yu
Information Processing Letters
31
, 1989, pp. 47-51
Notes on oriented depth-first search and longest paths
Hubert de Fraysseix
,
Hiroshi Imai
Information Processing Letters
31
, 1989, pp. 53-56
On the upper bound on the rotation distance of binary trees
F. Luccio
,
L. Pagli
Information Processing Letters
31
, 1989, pp. 57-60
Counting clique trees and computing perfect elimination schemes in parallel
Chin-Wen Ho
,
R.C.T. Lee
Information Processing Letters
31
, 1989, pp. 61-68
Worst-case data structures for the priority queue with attrition
Rajamani Sundar
Information Processing Letters
31
, 1989, pp. 69-75
An approximation algorithm for the TSP
J.M. Basart
,
L. Huguet
Information Processing Letters
31
, 1989, pp. 77-81
Analysis of random probing hashing
M.V. Ramakrishna
Information Processing Letters
31
, 1989, pp. 83-90
A note on higher-order functions versus logical variables
F. Warren Burton
Information Processing Letters
31
, 1989, pp. 91-95
An algorithm for colouring perfect planar graphs
Iain A. Stewart
Information Processing Letters
31
, 1989, pp. 97-101
A note on optimal parallel transformations of regular expressions to nondeterministic finite automata
Wojciech Rytter
Information Processing Letters
31
, 1989, pp. 103-109
Parallel parsing on the connection machine
D.B. Skillicorn
,
D.T. Barnard
Information Processing Letters
31
, 1989, pp. 111-117
Asymptotic evaluation of window visibility
Satoshi Matsuoka
,
Tomihisa Kamada
,
Satoru Kawai
Information Processing Letters
31
, 1989, pp. 119-126
Comments on ``Ring based termination detection algorithm for distributed computations''
G. Tel
,
F. Mattern
Information Processing Letters
31
, 1989, pp. 127-128
An
O(n\log n + m\log\log n)
maximum weight clique algorithm for circular-arc graphs
Wei-Kuan Shih
,
Wen-Lian Hsu
Information Processing Letters
31
, 1989, pp. 129-134
Achromatic number is
NP
-complete for cographs and interval graphs
Hans L. Bodlaender
Information Processing Letters
31
, 1989, pp. 135-138
On the use of random numbers in asynchronous simulation via rollback
John N. Tsitsiklis
Information Processing Letters
31
, 1989, pp. 139-144
Bin packing with restricted piece sizes
Joseph Y.-T. Leung
Information Processing Letters
31
, 1989, pp. 145-149
Data structures in a real-time environment
Patrick Lentfert
,
Mark H. Overmars
Information Processing Letters
31
, 1989, pp. 151-155
Seiten 1
2
3
>