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=62
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On a geometric problem of zigzags
Vesa Halava
,
Tero Harju
,
Lucian Ilie
Information Processing Letters
62
(1), 1997, pp. 1-4
Computing kernels in directed bichromatic graphs
Burghard von Karger
,
Rudolf Berghammer
Information Processing Letters
62
(1), 1997, pp. 5-11
A simple function that requires exponential size read-once branching programs
Anna Gál
Information Processing Letters
62
(1), 1997, pp. 13-16
Analysis of the Hilbert curve for representing two-dimensional space
H.V. Jagadish
Information Processing Letters
62
(1), 1997, pp. 17-22
Unfold/fold transformations for disjunctive logic programs
Manolis Gergatsoulis
Information Processing Letters
62
(1), 1997, pp. 23-29
Mutex needs fairness
Ekkart Kindler
,
Rolf Walter
Information Processing Letters
62
(1), 1997, pp. 31-39
Efficient test&set constructions for faulty shared memory
Ariel Orda
,
Michael Merritt
Information Processing Letters
62
(1), 1997, pp. 41-46
802.4 rate monotonic scheduling in hard real-time environments: Setting the medium access control parameters
J. Orozco
,
R. Cayssials
,
J. Santos
,
E. Ferro
Information Processing Letters
62
(1), 1997, pp. 47-55
Inferring uniquely terminating regular languages from positive data
Erkki Mäkinen
Information Processing Letters
62
(2), 1997, pp. 57-60
A generalization of chordal graphs and the maximum clique problem
Assef Chmeiss
,
Philippe Jégou
Information Processing Letters
62
(2), 1997, pp. 61-66
Approximating optimally discrete probability distribution with
k
th-order dependency for combining multiple decisions
Hee-Joong Kang
,
Kawon Kim
,
Jin H. Kim
Information Processing Letters
62
(2), 1997, pp. 67-75
Shared authentication token secure against replay and weak key attacks
Sung-Ming Yen
,
Kuo-Hong Liao
Information Processing Letters
62
(2), 1997, pp. 77-80
Area requirement of visibility representation of trees
Goos Kant
,
Giuseppe Liotta
,
Roberto Tamassia
,
Ioannis G. Tollis
Information Processing Letters
62
(2), 1997, pp. 81-88
Linear approximation of simple objects
Kasturi R. Varadarajan
,
Pankaj K. Agarwal
Information Processing Letters
62
(2), 1997, pp. 89-94
An improved deterministic algorithm for generating different many-element random samples
Amihood Amir
,
Emanuel Dar
Information Processing Letters
62
(2), 1997, pp. 95-101
Transforming comparison model lower bounds to the parallel-random-access-machine
Dany Breslauer
,
Artur Czumaj
,
Devdatt P. Dubhashi
,
Friedhelm Meyer auf der Heide
Information Processing Letters
62
(2), 1997, pp. 103-110
Using OBDDs to handle dynamic constraints
Fabrice Bouquet
,
Philippe Jégou
Information Processing Letters
62
(3), 1997, pp. 111-120
Dynamic connectivity in digital images
David Eppstein
Information Processing Letters
62
(3), 1997, pp. 121-126
A regeneration scheme for generating extensions
Robert Glück
,
Andrei Klimov
Information Processing Letters
62
(3), 1997, pp. 127-134
An
O(n \log n)
algorithm for finding dissimilar strings
Sarmad Abbasi
,
Anirvan Sengupta
Information Processing Letters
62
(3), 1997, pp. 135-139
A note on error-correcting codes for authentication and subliminal channels
Ching-Nung Yang
,
Chi-Sung Laih
Information Processing Letters
62
(3), 1997, pp. 141-143
The complexity of number-theoretic constants
Eric Bach
Information Processing Letters
62
(3), 1997, pp. 145-152
An optimal EREW PRAM algorithm for minimum spanning tree verification
Valerie King
,
Chung Keung Poon
,
Vijaya Ramachandran
,
Santanu Sinha
Information Processing Letters
62
(3), 1997, pp. 153-159
Decimal adjustment of long numbers in constant time
Andreas Döring
,
Wolfgang J. Paul
Information Processing Letters
62
(3), 1997, pp. 161-163
Large sets in
AC^0
have many strings with low Kolmogorov complexity
Marius Zimand
Information Processing Letters
62
(3), 1997, pp. 165-170
Seiten 1
2
3
>