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=67
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the time complexity of minimum and maximum global snapshot problems
Loon-Been Chen
,
I-Chen Wu
Information Processing Letters
67
(3), 1998, pp. 151-156
Finding shortest paths in distributed loop networkds
Nimmagadda Chalamaiah
,
Badrinath Ramamurthy
Information Processing Letters
67
(3), 1998, pp. 157-161
Parity OBDDs cannot be handled efficiently enough
Martin Löbbing
,
Detlef Sieling
,
Ingo Wegener
Information Processing Letters
67
(4), 1998, pp. 163-168
Pair algebras and Galois connections
Roland Backhouse
Information Processing Letters
67
(4), 1998, pp. 169-175
Self-organizing maps for drawing large graphs
Eric Bonabeau
,
Florian Hénaux
Information Processing Letters
67
(4), 1998, pp. 177-184
An improvement of algorithms for solving interface equations
Fabio Martinelli
Information Processing Letters
67
(4), 1998, pp. 185-190
A quorum based
k
-mutual exclusion by weighted
k
-quorum systems
Satoshi Fujita
Information Processing Letters
67
(4), 1998, pp. 191-197
Embeddings and the trace of finite sets
G. Greco
Information Processing Letters
67
(4), 1998, pp. 199-203
On the complexity of interactive proofs with bounded communication
Oded Goldreich
,
Johan Håstad
Information Processing Letters
67
(4), 1998, pp. 205-214
On the complexity of Boolean unification
Franz Baader
Information Processing Letters
67
(4), 1998, pp. 215-220
On syntactic nuclei of rational languages
Huaxiong Wang
Information Processing Letters
67
(5), 1998, pp. 221-226
Breaking symmetry in complete graphs by orienting edges: Asymptotic bounds
Frank Harary
,
Desh Ranjan
Information Processing Letters
67
(5), 1998, pp. 227-230
On the Traveling Salesman problem with a relaxed Monge matrix
Rainer E. Burkard
,
Vladimir G. Deĭneko
Information Processing Letters
67
(5), 1998, pp. 231-237
A note on minimizing submodular functions
Hiroshi Nagamochi
,
Toshihide Ibaraki
Information Processing Letters
67
(5), 1998, pp. 239-244
Root-neededness and approximations of neededness
Salvador Lucas
Information Processing Letters
67
(5), 1998, pp. 245-254
An
O(n^3)
time algorithm for recognizing threshold dimension 2 graphs
Andrea Sterbini
,
Thomas Raschle
Information Processing Letters
67
(5), 1998, pp. 255-259
An approximate binary search algorithm for the multiple-choice knapsack problem
George Gens
,
Eugene Levner
Information Processing Letters
67
(5), 1998, pp. 261-265
Improved approximation algorithms for embedding hyperedges in a cycle
Teofilo F. Gonzalez
Information Processing Letters
67
(5), 1998, pp. 267-271
A special arrangement with minimal number of triangles
J.L. Ramírez Alfonsín
Information Processing Letters
67
(6), 1998, pp. 273-276
An extension of the wreath product principle for finite Mazurkiewicz traces
G. Guaiana
,
R. Meyer
,
A. Petit
,
P. Weil
Information Processing Letters
67
(6), 1998, pp. 277-282
An efficient algorithm for
k
-pairwise disjoint paths in star graphs
Qian-Ping Gu
,
Shietung Peng
Information Processing Letters
67
(6), 1998, pp. 283-287
Reducing
\Omega
to
\diamond W
Francis Chu
Information Processing Letters
67
(6), 1998, pp. 289-293
Online channel allocation in FDMA networks with reuse constraints
Tomás Feder
,
Sunil M. Shende
Information Processing Letters
67
(6), 1998, pp. 295-302
Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees
Timothy M. Chan
Information Processing Letters
67
(6), 1998, pp. 303-304
Random permutations on distributed, external and hierarchical memory
P. Sanders
Information Processing Letters
67
(6), 1998, pp. 305-309
Seiten
<
1
2
3
>