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.
New local search approximation techniques for maximum generalized satisfiability problems
Paola Alimonti
Information Processing Letters
57
(3), 1996, pp. 151-158
A circuit for exact summation of floating-point numbers
Michael Müller
,
Christine Rüb
,
Wolfgang Rülling
Information Processing Letters
57
(3), 1996, pp. 159-163
Onion polygonizations
Manuel Abellanas
,
Jesús García
,
Gregorio Hernández-Peñalver
,
Ferrán Hurtado
,
Oriol Serra
,
Jorge Urrutia
Information Processing Letters
57
(3), 1996, pp. 165-173
Medians and centres of polyominoes
Yves Métivier
,
Nasser Saheb
Information Processing Letters
57
(4), 1996, pp. 175-181
Shortest routing in trivalent Cayley graph network
Premkumar Vadapalli
,
Pradip K. Srimani
Information Processing Letters
57
(4), 1996, pp. 183-188
On the sample complexity of noise-tolerant learning
Javed A. Aslam
,
Scott E. Decatur
Information Processing Letters
57
(4), 1996, pp. 189-195
A simple linear-time algorithm for finding path-decompositions of small width
Kevin Cattell
,
Michael J. Dinneen
,
Michael R. Fellows
Information Processing Letters
57
(4), 1996, pp. 197-203
Seek distances in two-headed disk systems
M. Manzur Murshed
,
M. Kaykobad
Information Processing Letters
57
(4), 1996, pp. 205-209
A characterization of the information content of a classification
Kenneth Baclawski
,
Dan A. Simovici
Information Processing Letters
57
(4), 1996, pp. 211-214
Routing on trees
Antonios Symvonis
Information Processing Letters
57
(4), 1996, pp. 215-223
On the number of edges in cycletrees
Margus Veanes
,
Jonas Barklund
Information Processing Letters
57
(4), 1996, pp. 225-229
A note on minimum-area upward drawing of complete and Fibonacci trees
Luca Trevisan
Information Processing Letters
57
(5), 1996, pp. 231-236
More on BPP and the polynomial-time hierarchy
Ran Canetti
Information Processing Letters
57
(5), 1996, pp. 237-241
Limitations of fast consistency conditions for distributed shared memories
Hagit Attiya
,
Roy Friedman
Information Processing Letters
57
(5), 1996, pp. 243-248
The 2-evader problem
Elias Koutsoupias
,
Christos Papadimitriou
Information Processing Letters
57
(5), 1996, pp. 249-252
Drawing outerplanar minimum weight triangulations
William Lenhart
,
Giuseppe Liotta
Information Processing Letters
57
(5), 1996, pp. 253-260
Bounds on the number of functions satisfying the strict avalanche criterion
Thomas W. Cusick
Information Processing Letters
57
(5), 1996, pp. 261-263
On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks
Suresh Viswanathan
,
Éva Czabarka
,
Abhijit Sengupta
Information Processing Letters
57
(5), 1996, pp. 265-271
The two headed disk: Stochastic dominance of the greedy policy
S. Seshadri
,
D. Rotem
Information Processing Letters
57
(5), 1996, pp. 273-277
A gap theorem for the anonymous torus
Angelo Monti
,
Alessandro Roncato
Information Processing Letters
57
(5), 1996, pp. 279-285
An NC algorithm for the clique cover problem in cocomparability graphs and its application
Chongkye Rhee
,
Y. Daniel Liang
Information Processing Letters
57
(5), 1996, pp. 287-290
On the computational complexity of graph closures
Angelo Monti
Information Processing Letters
57
(6), 1996, pp. 291-295
A note on scheduling on a single procesor with speed dependent on a number of executed jobs
Stanisƚaw Gawiejnowicz
Information Processing Letters
57
(6), 1996, pp. 297-300
A higly safe self-stabilizing mutual exclusion algorithm
I-Ling Yen
Information Processing Letters
57
(6), 1996, pp. 301-305
On pattern occurrences in a random text
Ioannis Fudos
,
Evaggelia Pitoura
,
Wojciech Szpankowski
Information Processing Letters
57
(6), 1996, pp. 307-312
Seiten
<
1
2
3
>