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=59
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sensitivity vs. block sensitivity (an average-case study)
A. Bernasconi
Information Processing Letters
59
(3), 1996, pp. 151-157
Unifying
wp
and
wlp
Carroll Morgan
,
Annabelle McIver
Information Processing Letters
59
(3), 1996, pp. 159-163
Literal shuffle on
\omega
-languages
Tetsuo Moriya
,
Hideki Yamasaki
Information Processing Letters
59
(3), 1996, pp. 165-168
On-line versus off-line computation in dynamic text compression
Sergio De Agostino
,
James A. Storer
Information Processing Letters
59
(3), 1996, pp. 169-174
Inscribing a symmetric body in an ellipse
Francisco Santos
Information Processing Letters
59
(4), 1996, pp. 175-178
Modelling causality via action dependencies in branching time semantics
Ursula Goltz
,
Heike Wehrheim
Information Processing Letters
59
(4), 1996, pp. 179-184
Hypercube permutations routable under all dimension orderings
Petrişor Panaite
Information Processing Letters
59
(4), 1996, pp. 185-189
A distributed method to bound rollback lengths for fossil collection in time warp simulators
Christopher H. Young
,
Philip A. Wilsey
Information Processing Letters
59
(4), 1996, pp. 191-196
Convergence of inconsistency algorithms for the pairwise comparisons
Wƚodzimierz Holsztyński
,
Waldemar W. Koczkodaj
Information Processing Letters
59
(4), 1996, pp. 197-202
The element distinctness problem on one-tape Turing machines
Andrzej Szepietowski
Information Processing Letters
59
(4), 1996, pp. 203-206
Finding a shortes Hamiltonian path inside a simple polygon
Muhammad H. Alsuwaiyel
Information Processing Letters
59
(4), 1996, pp. 207-210
Succinct circuit representations and leaf language classes are basically the same concept
Bernd Borchert
,
Antoni Lozano
Information Processing Letters
59
(4), 1996, pp. 211-215
Embedding a ring in a hypercube with both faulty links and faulty nodes
Yu-Chee Tseng
Information Processing Letters
59
(4), 1996, pp. 217-222
Hyperspherical neighbourhoods and pattern recognition using neural networks
G. Athithan
,
T. Sony Roy
Information Processing Letters
59
(4), 1996, pp. 223-228
A fundamental restriction on fully dynamic maintenance of bin packing
Zoran Ivković
,
Errol L. Lloyd
Information Processing Letters
59
(4), 1996, pp. 229-232
On the effect of local changes in the variable ordering of ordered decision diagrams
Beate Bollig
,
Martin Löbbing
,
Ingo Wegener
Information Processing Letters
59
(5), 1996, pp. 233-239
A framework to animate string algorithms
Ricardo A. Baeza-Yates
,
Luis O. Fuentes
Information Processing Letters
59
(5), 1996, pp. 241-244
A note on fairness in I/O automata
Judi Romijn
,
Frits Vaandrager
Information Processing Letters
59
(5), 1996, pp. 245-250
A size-depth trade-off for the analog computation of Boolean functions
Györgi Turán
,
Farrokh Vatan
Information Processing Letters
59
(5), 1996, pp. 251-254
Output-sensitive peeling of convex and maximal layers
Franck Nielsen
Information Processing Letters
59
(5), 1996, pp. 255-259
Algorithms for deciding the containment of polygons
Antonio Hernández Barrera
Information Processing Letters
59
(5), 1996, pp. 261-265
Parallel tree-contraction and Fibonacci numbers
Wojciech Plandowski
,
Wojciech Rytter
,
Tomasz Szymacha
Information Processing Letters
59
(5), 1996, pp. 267-271
Negation-limited circuit complexity of symmetric functions
Keisuke Tanaka
,
Tetsuro Nishino
,
Robert Beals
Information Processing Letters
59
(5), 1996, pp. 273-279
An exercise in fault-containment: Self-stabilizing leader elcetion
Sukumar Ghosh
,
Arobinda Gupta
Information Processing Letters
59
(5), 1996, pp. 281-288
Parallel maximum independent set in convex bipartite graphs
Artur Czumaj
,
Krzysztof Diks
,
Teresa M. Przytycka
Information Processing Letters
59
(6), 1996, pp. 289-294
Seiten
<
1
2
3
>