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=68
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Invariants for the construction of a handshake register
Wim H. Hesselink
Information Processing Letters
68
(4), 1998, pp. 173-177
Pruned three-dimensional toroidal networks
Ding-Ming Kwai
,
Behrooz Parhami
Information Processing Letters
68
(4), 1998, pp. 179-183
Information concepts and pairwise comparison matrices
Pedro P. Sanchez
,
Refik Soyer
Information Processing Letters
68
(4), 1998, pp. 185-188
Learning conjunctions with noise under product distributions
Yishay Mansour
,
Michal Parnas
Information Processing Letters
68
(4), 1998, pp. 189-196
Attacks on Shamir's `RSA for paranoids'
Henri Gilbert
,
Dipankar Gupta
,
Andrew Odlyzko
,
Jean-Jacques Quisquater
Information Processing Letters
68
(4), 1998, pp. 197-199
Vertex ranking of asteroidal triple-free graphs
Ton Kloks
,
Haiko Müller
,
C.K. Wong
Information Processing Letters
68
(4), 1998, pp. 201-206
On ring embedding in hypercubes with faulty nodes and links
Abhijit Sengupta
Information Processing Letters
68
(4), 1998, pp. 207-214
A modified version of the Rao-Nam algebraic-code encryption scheme
Yi Chang Cheng
,
Erl Huei Lu
,
Shaw Woei Wu
Information Processing Letters
68
(4), 1998, pp. 215-217
Colored cause-effect structures
A.P. Ustimenko
Information Processing Letters
68
(5), 1998, pp. 219-225
How to construct efficient signcryption schemes on elliptic curves
Yuliang Zheng
,
Hideki Imai
Information Processing Letters
68
(5), 1998, pp. 227-233
A dynamic scheduling algorithm for large scale multimedia servers
Kyung Oh Lee
,
Heon Y. Yeom
Information Processing Letters
68
(5), 1998, pp. 235-240
A natural family of optimization problems with arbitrarily small approximation thresholds
Venkatesan Guruswami
,
C. Pandu Rangan
Information Processing Letters
68
(5), 1998, pp. 241-248
Near-optimal nonapproximability results for some
NpoPB
-complete problems
P. Jonsson
Information Processing Letters
68
(5), 1998, pp. 249-253
An Eades-McKay algorithm for well-formed parentheses strings
Bette Bultena
,
Frank Ruskey
Information Processing Letters
68
(5), 1998, pp. 255-259
Binary search with errors and variable cost queries
Matteo Sereno
Information Processing Letters
68
(5), 1998, pp. 261-270
A new algebraic algorithm to decode the ternary Golay code
Josep Rifà
Information Processing Letters
68
(6), 1998, pp. 271-274
Simulation of PRAMs with scan primitives by unbounded fan-in circuits
Rakesh K. Sinha
Information Processing Letters
68
(6), 1998, pp. 275-282
Computing the relative entropy between regular tree languages
Jorge Calera-Rubio
,
Rafael C. Carrasco
Information Processing Letters
68
(6), 1998, pp. 283-289
A simple optimal algorithm for scheduling variable-sized requests
Janelle J. Harms
Information Processing Letters
68
(6), 1998, pp. 291-293
A formula for the number of spanning trees of a multi-star related graph
Wen-Ming Yan
,
Wendy Myrvold
,
Kuo-Liang Chung
Information Processing Letters
68
(6), 1998, pp. 295-298
Weak and strong one-way space complexity classes
Andrzej Szepietowski
Information Processing Letters
68
(6), 1998, pp. 299-302
Hierarchical broadcast networks
Pierre Fraigniaud
Information Processing Letters
68
(6), 1998, pp. 303-305
Local calculation of Voronoi diagrams
Ulrich Kühn
Information Processing Letters
68
(6), 1998, pp. 307-312
Bandwidth of chain graphs
Ton Kloks
,
Dieter Kratsch
,
Haiko Müller
Information Processing Letters
68
(6), 1998, pp. 313-315
Improved lower bounds for the link length of rectilinear spanning paths in grids
Michael J. Collins
,
Bernard M.E. Moret
Information Processing Letters
68
(6), 1998, pp. 317-319
Seiten
<
1
2