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=45
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Normal forms have partial types
Jens Palsberg
Information Processing Letters
45
(1), 1993, pp. 1-3
Improving the efficiency of depth-first search by cycle elimination
John F. Dillenburg
,
Peter C. Nelson
Information Processing Letters
45
(1), 1993, pp. 5-10
Identifying periodic occurrences of a template with applications to protein structure
Vincent A. Fischetti
,
Gad M. Landau
,
Peter H. Sellers
,
Jeanette P. Schmidt
Information Processing Letters
45
(1), 1993, pp. 11-18
A still better performance guarantee for approximate graph coloring
Magnús M. Halldórsson
Information Processing Letters
45
(1), 1993, pp. 19-23
The most vital edges in the minimum spanning tree problem
Kao-Chêng Lin
,
Maw-Sheng Chern
Information Processing Letters
45
(1), 1993, pp. 25-31
Multidisk partial match file design with known access pattern
Jeong Uk Kim
,
Ho Chang
,
Tag Gon Kim
Information Processing Letters
45
(1), 1993, pp. 33-39
A systematic analysis of splaying
Berry Schoenmakers
Information Processing Letters
45
(1), 1993, pp. 41-50
Fast two-dimensional pattern matching
Ricardo Baeza-Yates
,
Mireille Régnier
Information Processing Letters
45
(1), 1993, pp. 51-57
The generic oracle hypothesis is false
James A. Foster
Information Processing Letters
45
(2), 1993, pp. 59-62
Reduction of network cost and wiring in Ranade's butterfly routing
David Cross
,
Reinhard Drefenstedt
,
Jörg Keller
Information Processing Letters
45
(2), 1993, pp. 63-67
Permutations on the Block PRAM
Andrew Chin
Information Processing Letters
45
(2), 1993, pp. 69-73
From algebra to operational semantics
He Jifeng
,
C.A.R. Hoare
Information Processing Letters
45
(2), 1993, pp. 75-80
Simple bounds on the convergence rate of an ergodic Markov chain
Slawomir Pilarski
,
Tiko Kameda
Information Processing Letters
45
(2), 1993, pp. 81-87
NP-completeness of
k
-connected hyperedge-replacement languages of order
k
Frank Drewes
Information Processing Letters
45
(2), 1993, pp. 89-94
Approximate closest-point queries in high dimensions
Marshall Bern
Information Processing Letters
45
(2), 1993, pp. 95-99
Space-efficient asynchronous consensus without shared memory initialization
Michael J. Fischer
,
Shlomo Moran
,
Gadi Taubenfeld
Information Processing Letters
45
(2), 1993, pp. 101-105
A probabilistic algorithm for verifying matrix products using
O(n^2)
time and
\log_2n+O(1)
random bits
Tracy Kimbrel
,
Rakesh Kumar Sinha
Information Processing Letters
45
(2), 1993, pp. 107-110
I/O- and CPU-optimal recognition of strongly connected components
Bin Jiang
Information Processing Letters
45
(3), 1993, pp. 111-115
A tool for the analysis of manipulation
Desh Ranjan
,
Daniela Rus
Information Processing Letters
45
(3), 1993, pp. 117-121
Unidirectional star graphs
Khaled Day
,
Anand Tripathi
Information Processing Letters
45
(3), 1993, pp. 123-129
The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
Cheng-Chia Chen
,
I-Peng Lin
Information Processing Letters
45
(3), 1993, pp. 131-136
Speeding Lamport's fast mutual exclusion algorithm
Michael Merritt
,
Gadi Taubenfeld
Information Processing Letters
45
(3), 1993, pp. 137-142
On the relationship between deterministic time and deterministic reversal
Maciej Liśkiewicz
Information Processing Letters
45
(3), 1993, pp. 143-146
Improved processor bounds for parallel algorithms for weighted directed graphs
Nancy Amato
Information Processing Letters
45
(3), 1993, pp. 147-152
Optimal block size for set-valued attributes
Suchen H. Hsu
,
Richard Snodgrass
Information Processing Letters
45
(3), 1993, pp. 153-158
Seiten 1
2
3
>