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 Volume=11
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Rigid reachability the non-symmetric form of rigid
E
-unification
Harald Ganzinger
,
Florent Jacquemard
,
Margus Veanes
International Journal of Foundations of Computer Science
11
(1), 2000, pp. 3-27
Type inference for first-class messages with feature constraints
Martin Müller
,
Susumu Nishimura
International Journal of Foundations of Computer Science
11
(1), 2000, pp. 29-63
First-class contexts in ML
Masatomo Hashimoto
International Journal of Foundations of Computer Science
11
(1), 2000, pp. 65-87
Constructive classical logic as CPS-calculus
Ichiro Ogata
International Journal of Foundations of Computer Science
11
(1), 2000, pp. 89-112
Light affine logic as a programming language: A first contribution
Luca Roversi
International Journal of Foundations of Computer Science
11
(1), 2000, pp. 113-152
Guaranteed mutually consistent checkpointing in distributed computations
Zhonghua Yang
,
Chengzheng Sun
,
Yuan Miao
,
Abdul Sattar
,
Yanyan Yang
International Journal of Foundations of Computer Science
11
(1), 2000, pp. 153-166
Computing with membranes (
P
systems): A variant
Gheorghe Păun
International Journal of Foundations of Computer Science
11
(1), 2000, pp. 167-181
Guidelines for data-parallel cycle-stealing in networks of workstations - II: On maximizing guaranteed output
Arnold L. Rosenberg
International Journal of Foundations of Computer Science
11
(1), 2000, pp. 183-204
Special issue on randomized computing
Sanguthevar Rajasekaran
,
Sartaj K. Sahni
International Journal of Foundations of Computer Science
11
(2), 2000, pp. 205-205
A method for evaluating the expected load of dynamic tree embeddings in hypercubes
Keqin Li
International Journal of Foundations of Computer Science
11
(2), 2000, pp. 207-230
Random seeking: A general, efficient, and informed randomized scheme for dynamic load balancing
Nihar R. Mahapatra
,
Shantanu Dutt
International Journal of Foundations of Computer Science
11
(2), 2000, pp. 231-246
Connectivity properties in random regular graphs with edge faults
S. Nikoletseas
,
K. Palem
,
P. Spirakis
,
M. Yung
International Journal of Foundations of Computer Science
11
(2), 2000, pp. 247-262
On the dealer's randomness required in perfect secret sharing schemes with access structures of constant rank
Hung-Min Sun
International Journal of Foundations of Computer Science
11
(2), 2000, pp. 263-281
Languages for reactive specifications: Synchrony vs asynchrony
R.K. Shyamasundar
,
S. Ramesh
International Journal of Foundations of Computer Science
11
(2), 2000, pp. 283-314
The operators min and max on the polynomial hierarchy
Harald Hempel
,
Gerd Wechsung
International Journal of Foundations of Computer Science
11
(2), 2000, pp. 315-342
Finding small equivalent decision trees is hard
Hans Zantema
,
Hans L. Bodlaender
International Journal of Foundations of Computer Science
11
(2), 2000, pp. 343-354
Mod-2 independence and domination in graphs
Magnús M. Halldórsson
,
Jan Kratochvíl
,
Jan Arne Telle
International Journal of Foundations of Computer Science
11
(3), 2000, pp. 355-363
An improved algorithm for finding tree decompositions of small width
Ljubomir Perković
,
Bruce Reed
International Journal of Foundations of Computer Science
11
(3), 2000, pp. 365-371
NLC
_2
-decomposition in polynomial time
Öjvind Johansson
International Journal of Foundations of Computer Science
11
(3), 2000, pp. 373-395
Generating all the minimal separators of a graph
Anne Berry
,
Jean-Paul Bordat
,
Olivier Cogis
,
L.I.R.M.M.
International Journal of Foundations of Computer Science
11
(3), 2000, pp. 397-403
All separating triangles in a plane graph can be optimally ``broken'' in polynomial time
Anna Accornero
,
Massimo Ancona
,
Sonia Varini
International Journal of Foundations of Computer Science
11
(3), 2000, pp. 405-421
On the clique-width of some perfect graph classes
Martin Charles Golumbic
,
Udi Rotics
International Journal of Foundations of Computer Science
11
(3), 2000, pp. 423-443
Finding smallest supertrees under minor containment
Naomi Nishimura
,
Prabhakar Ragde
,
Dimitrios M. Thilikos
International Journal of Foundations of Computer Science
11
(3), 2000, pp. 445-465
On the hardness of recognizing bundles in time table graphs
Annegret Liebers
,
Dorothea Wagner
,
Karsten Weihe
International Journal of Foundations of Computer Science
11
(3), 2000, pp. 467-484
A new weight balanced binary search tree
Seonghun Cho
,
Sartaj Sahni
International Journal of Foundations of Computer Science
11
(3), 2000, pp. 485-513
Seiten 1
2
>