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=60
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hamilton cycles in trivalent Cayley graphs
Meghanad D. Wagh
,
Jiancheng Mo
Information Processing Letters
60
(4), 1996, pp. 177-181
Perfectly overlapped merging and sorting on a two-way linear array
Yen-Chun Lin
Information Processing Letters
60
(4), 1996, pp. 183-187
Scheduling on a single processor with variable speed
Bahram Alidaee
,
Ahmad Ahmadian
Information Processing Letters
60
(4), 1996, pp. 189-193
Space-optimal hidden line elimination for rectangles
Nectarios Kitsios
,
Athanasios Tsakalidis
Information Processing Letters
60
(4), 1996, pp. 195-200
Approximately satisfied properties of systems and simple language homomorphisms
Ulrich Nitsche
,
Peter Ochsenschläger
Information Processing Letters
60
(4), 1996, pp. 201-206
Formal derivation of an algorithm for distributed phase synchronization
D.S. Buhăceanu
,
W.H.J. Feijen
Information Processing Letters
60
(4), 1996, pp. 207-213
Bounds on the number of functions satisfying the Strict Avalanche Criterion
Thomas W. Cusick
,
Pantelimon Stănică
Information Processing Letters
60
(4), 1996, pp. 215-219
K_{1,3}
-free and
W_4
-free graphs
T. Kloks
Information Processing Letters
60
(4), 1996, pp. 221-223
Approximating the maximally balanced connected partition problem in graphs
Janka Chlebíková
Information Processing Letters
60
(5), 1996, pp. 225-230
A parallel tree difference algorithm
D.B. Skillicorn
Information Processing Letters
60
(5), 1996, pp. 231-235
Term rewriting and Hoare logic - Coded rewriting
Yong Sun
Information Processing Letters
60
(5), 1996, pp. 237-242
NC
algorithms for the single most vital edge problem with respect to shortest paths
Sven Venema
,
Hong Shen
,
Francis Suraweera
Information Processing Letters
60
(5), 1996, pp. 243-248
Approximate triclique coloring for register allocation
G. Venkatesan
,
C. Pandu Rangan
Information Processing Letters
60
(5), 1996, pp. 249-253
A grid embedding into the star graph for image analysis solutions
Nayla Nassif
,
Nader Bagherzadeh
Information Processing Letters
60
(5), 1996, pp. 255-260
On the security of image encryption method
Jinn-Ke Jan
,
Yuh-Min Tseng
Information Processing Letters
60
(5), 1996, pp. 261-265
Square rooting by iterative multiply-additions
Masayuki Ito
,
Naofumi Takagi
,
Shuzo Yajima
Information Processing Letters
60
(5), 1996, pp. 267-269
Comment on ``Bounds on the number of functions satisfying the Strict Avalanche Criterion''
A.M. Youssef
,
S.E. Tavares
Information Processing Letters
60
(5), 1996, pp. 271-275
A new privacy homomorphism and applications
Josep Domingo i Ferrer
Information Processing Letters
60
(5), 1996, pp. 277-282
Two shortest path metrics on well-formed parentheses strings
Christian Germain
,
Jean Pallo
Information Processing Letters
60
(6), 1996, pp. 283-287
There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
Sven-Olof Nyström
Information Processing Letters
60
(6), 1996, pp. 289-293
Nearly-perfect hypergraph packing is in
NC
David A. Grable
Information Processing Letters
60
(6), 1996, pp. 295-299
Combinatorial lower bounds for secret sharing schemes
Kaoru Kurosawa
,
Koji Okada
Information Processing Letters
60
(6), 1996, pp. 301-304
Partial evaluation of queries for bit-sliced signature files
Seyit Kocberber
,
Fazli Can
Information Processing Letters
60
(6), 1996, pp. 305-311
Construction of natural cycletrees
Margus Veanes
,
Jonas Barklund
Information Processing Letters
60
(6), 1996, pp. 313-318
Seiten
<
1
2