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=International Journal of Foundations of Computer Science AND YEAR=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Mergeable double-ended priority queues
Seonghun Cho
,
Sartaj Sahni
International Journal of Foundations of Computer Science
10
(1), 1999, pp. 1-17
Parallel vertex colouring of interval graphs
G. Sajith
,
Sanjeev Saxena
International Journal of Foundations of Computer Science
10
(1), 1999, pp. 19-31
A self-stabilizing algorithm for finding articulation points
Mehmet Hakan Karaata
International Journal of Foundations of Computer Science
10
(1), 1999, pp. 33-46
Parallel maximum matching algorithms in interval graphs
Yoojin Chung
,
Kunsoo Park
,
Yookun Cho
International Journal of Foundations of Computer Science
10
(1), 1999, pp. 47-60
On the leftmost derivation in matrix grammars
Jürgen Dassow
,
Henning Fernau
,
Gheorghe Păun
International Journal of Foundations of Computer Science
10
(1), 1999, pp. 61-79
DFT techniques for size estimation of database join operations
Kamil Saraç
,
Ömer Eğecioğlu
,
Amr El Abbadi
International Journal of Foundations of Computer Science
10
(1), 1999, pp. 81-102
On graphs with limited number of
P_4
-partners
Florian Roussel
,
Irena Rusu
,
Henri Thuillier
International Journal of Foundations of Computer Science
10
(1), 1999, pp. 103-121
Holes and dominoes in Meyniel graphs
Florian Roussel
,
Irena Rusu
International Journal of Foundations of Computer Science
10
(2), 1999, pp. 127-146
Partition refinement techniques: An interesting algorithmic tool kit
Michel Habib
,
Christophe Paul
,
Laurent Viennot
International Journal of Foundations of Computer Science
10
(2), 1999, pp. 147-170
A polynomial-time algorithm for finding total colorings of partial
k
-trees
Shuji Isobe
,
Xiao Zhou
,
Takao Nishizeki
International Journal of Foundations of Computer Science
10
(2), 1999, pp. 171-194
A linear-time algorithm to find four independent spanning trees in four connected planar graphs
Kazuyuki Miura
,
Daishiro Takahashi
,
Shin-Ichi Nakano
,
Takao Nishizeki
International Journal of Foundations of Computer Science
10
(2), 1999, pp. 195-210
On the complexity of some adaptive polling algorithms in general networks
Savio S.H. Tse
,
Francis C.M. Lau
International Journal of Foundations of Computer Science
10
(2), 1999, pp. 211-223
A graph based Davidson algorithm for the graph partitioning problem
Michael Holzrichter
,
Suely Oliveira
International Journal of Foundations of Computer Science
10
(2), 1999, pp. 225-246
Deviation algorithms for ranking shortest paths
Ernesto de Queirós Vieira Martins
,
Marta Margarida Braz Pascoal
,
José Luis Esteves Dos Santos
International Journal of Foundations of Computer Science
10
(3), 1999, pp. 247-261
Self-specifying machines
Lane A. Hemaspaandra
,
Harald Hempel
,
Gerd Wechsung
International Journal of Foundations of Computer Science
10
(3), 1999, pp. 263-276
Optimal layout of trivalent Cayley interconnection networks
Tiziana Calamoneri
,
Rossella Petreschi
International Journal of Foundations of Computer Science
10
(3), 1999, pp. 277-287
The isoperimetric number of
d
-dimensional
k
-ary arrays
M. Cemil Azizoğlu
,
Ömer Eğecioğlu
International Journal of Foundations of Computer Science
10
(3), 1999, pp. 289-300
On grouping in relational algebra
Kim S. Larsen
International Journal of Foundations of Computer Science
10
(3), 1999, pp. 301-311
Real-time dispatching: Scheduling stability and precedence
Axel W. Krings
,
Moshe Dror
International Journal of Foundations of Computer Science
10
(3), 1999, pp. 313-327
On the clique-width of graphs with few
P_4
's
J.A. Makowsky
,
U. Rotics
International Journal of Foundations of Computer Science
10
(3), 1999, pp. 329-348
Grammars and automata to optimize chain logic queries
Sergio Greco
,
Domenico Saccà
,
Carlo Zaniolo
International Journal of Foundations of Computer Science
10
(3), 1999, pp. 349-372
Parallel range minima on coarse grained multicomputers
H. Mongelli
,
S.W. Song
International Journal of Foundations of Computer Science
10
(4), 1999, pp. 375-389
Deterministic branch-and-bound on distributed memory machines
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
International Journal of Foundations of Computer Science
10
(4), 1999, pp. 391-404
Cluster-based task scheduling for the LogP model
Cristina Boeres
,
Aline Nascimento
,
Vinod E.F. Rebello
International Journal of Foundations of Computer Science
10
(4), 1999, pp. 405-424
Sparse computation with
P_{EI}
Frédérique Voisin
,
Guy-René Perrin
International Journal of Foundations of Computer Science
10
(4), 1999, pp. 425-442
Seiten 1
2
>