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=57
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Modal logics in the theory of relational databases
S.K. Das
Information Processing Letters
57
(1), 1996, pp. 1-7
Lower bounds on type checking overloading
Dennis M. Volpano
Information Processing Letters
57
(1), 1996, pp. 9-13
A note on "A simplified account of polymorphic references"
Robert Harper
Information Processing Letters
57
(1), 1996, pp. 15-16
A short certificate of the number of universal optimal strategies for stopping simple stochastic games
Akio Yanbe
,
Kouichi Sakurai
Information Processing Letters
57
(1), 1996, pp. 17-24
A Monte Carlo study of pairwise comparison
Michael W. Herman
,
Waldemar W. Koczkodaj
Information Processing Letters
57
(1), 1996, pp. 25-29
Complexity of Boolean functions over bases with unbounded fan-in gates
Vlado Danc̑ík
Information Processing Letters
57
(1), 1996, pp. 31-34
Real-time scheduling of linear speedup parallel tasks
Maciej Drozdowski
Information Processing Letters
57
(1), 1996, pp. 35-40
Combinatorial properties of generalized hypercube graphs
Dyi-Rong Duh
,
Gen-Huey Chen
,
D. Frank Hsu
Information Processing Letters
57
(1), 1996, pp. 41-45
On a class of square-free graphs
Qingbo Xue
Information Processing Letters
57
(1), 1996, pp. 47-48
Integrating authentication in public key distribution system
Wei-Bin Lee
,
Chin-Chen Cheng
Information Processing Letters
57
(1), 1996, pp. 49-52
A uniform model for the storage utilization of B-tree-like structures
Donatella Merlini
,
Renzo Sprugnoli
,
M. Cecilia Verri
Information Processing Letters
57
(1), 1996, pp. 53-58
A high-low Kolmogorov complexity law equivalent to the 0-1 law
Marius Zimand
Information Processing Letters
57
(2), 1996, pp. 59-64
An
O(n \log n)
implementation of the standard method for minimizing
n
-state finite automata
Norbert Blum
Information Processing Letters
57
(2), 1996, pp. 65-69
A note on the commutative closure of star-free languages
Anca Muscholl
,
Holger Petersen
Information Processing Letters
57
(2), 1996, pp. 71-74
An on-line algorithm to optimize file layout in a dynamic environment
Shahram Ghandeharizadeh
,
Doug Ierardi
,
Roger Zimmermann
Information Processing Letters
57
(2), 1996, pp. 75-81
A simple randomized parallel algorithm for maximal
f
-matchings
Oscar Garrido
,
Stefan Jarominek
,
Andrzej Lingas
,
Wojciech Rytter
Information Processing Letters
57
(2), 1996, pp. 83-87
On 2-QBF truth testing in parallel
Bengt Aspvall
,
Christos Levcopoulos
,
Andrzej Lingas
,
Robert Storlind
Information Processing Letters
57
(2), 1996, pp. 89-93
Conjuctive query containment with respect to views and constraints
Guozhu Dong
,
Jianwen Su
Information Processing Letters
57
(2), 1996, pp. 95-102
A lower bound for communication on the crossbar
Xiaotie Deng
Information Processing Letters
57
(2), 1996, pp. 103-108
A generalization of binomial queues
Rolf Fagerberg
Information Processing Letters
57
(2), 1996, pp. 109-114
A note on the monotone complexity of 2-REF
Peter Clote
Information Processing Letters
57
(3), 1996, pp. 117-123
A note on the equivalence problem of E-patterns
G. Dányi
,
Z. Fülöp
Information Processing Letters
57
(3), 1996, pp. 125-128
Tight lower bounds for minimum weight triangulation heuristics
Christos Levcopoulos
,
Drago Krznaric
Information Processing Letters
57
(3), 1996, pp. 129-135
Scalability and the isomorphism problem
Judy Goldsmith
,
Steven Homer
Information Processing Letters
57
(3), 1996, pp. 137-143
A more general sufficient condition for partition testing to be better than random testing
Tsong Yueh Chen
,
Yuen Tak Yu
Information Processing Letters
57
(3), 1996, pp. 145-149
Seiten 1
2
3
>