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
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the learnability of monotone
k\mu
-DNF formulae under product distributions
Michele Flammini
Information Processing Letters
52
, 1994, pp. 167-173
Upward separation for FewP and related classes
Rajesh P.N. Rao
,
Jörg Rothe
,
Osamu Watanabe
Information Processing Letters
52
, 1994, pp. 175-180
The convergence span of greedy load balancing
Ernie Cohen
Information Processing Letters
52
, 1994, pp. 181-182
Finding Hamiltonian circuits in arrangements of Jordan curves is NP-complete
Chuzo Iwamoto
,
Godfried T. Toussaint
Information Processing Letters
52
, 1994, pp. 183-189
Path for AND-parallel execution of logic programs
Su-Hyun Lee
,
Do-Hyung Kim
,
Kwang-Moo Choe
Information Processing Letters
52
, 1994, pp. 191-199
On dynamic threshold schemes
Hung-Min Sun
,
Shiuh-Pyng Shieh
Information Processing Letters
52
, 1994, pp. 201-206
An efficient transitive closure algorithm for cyclic digraphs
Esko Nuutila
Information Processing Letters
52
, 1994, pp. 207-213
Rectilinear decompositions with low stabbing number
Mark de Berg
,
Marc van Kreveld
Information Processing Letters
52
, 1994, pp. 215-221
An optimal parallel algorithm for maximal matching
Pierre Kelsen
Information Processing Letters
52
, 1994, pp. 223-228
Refined simulation of multihead automata
H. Petersen
Information Processing Letters
52
, 1994, pp. 229-233
On collapsing the polynomial-time hierarchy
Ronald V. Book
Information Processing Letters
52
, 1994, pp. 235-237
On the parallel complexity of digraph reachability
Samir Khuller
,
Uzi Vishkin
Information Processing Letters
52
, 1994, pp. 239-241
Loopless generation of
k
-ary tree sequences
James F. Korsh
Information Processing Letters
52
, 1994, pp. 243-247
Algorithms to count paths and cycles
Eric T. Bax
Information Processing Letters
52
, 1994, pp. 249-252
Linear-time construction of treaps and Cartesian trees
Mark Allen Weiss
Information Processing Letters
52
, 1994, pp. 253-257
A fuzzy clustering algorithm for graph bisection
Jin-Tai Yan
,
Pei-Yung Hsiao
Information Processing Letters
52
, 1994, pp. 259-263
A parallel algorithm for finding a triconnected component separator with an application
Zhi-Zhong Chen
Information Processing Letters
52
, 1994, pp. 265-271
Generalization of a new definition of consistency for pairwise comparisons
Zbigniew Duszak
,
Waldemar W. Koczkodaj
Information Processing Letters
52
, 1994, pp. 273-276
A parallel list update problem
F. Luccio
,
A. Pedrotti
Information Processing Letters
52
, 1994, pp. 277-284
Bisimulation is two-way simulation
J.A. Bergstra
,
Gh. Şefănescu
Information Processing Letters
52
, 1994, pp. 285-287
On repeated factors in
C^{\infty}
-words
Arturo Carpi
Information Processing Letters
52
, 1994, pp. 289-294
A general framework for minimax search in game trees
Subir Bhattacharya
,
A. Bagchi
Information Processing Letters
52
, 1994, pp. 295-301
A data structure for bicategories, with application to speeding up an approximation algorithm
Philip N. Klein
Information Processing Letters
52
, 1994, pp. 303-307
Dominations in trapezoid graphs
Y. Daniel Liang
Information Processing Letters
52
, 1994, pp. 309-315
The path-partition problem in block graphs
Jing-Ho Yan
,
Gerard J. Chang
Information Processing Letters
52
, 1994, pp. 317-322
Seiten
<
1
2
3
4
5
6
7
8
9
>