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=12
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lambda-representable functions over term algebras
Masako Takahashi
International Journal of Foundations of Computer Science
12
(1), 2001, pp. 3-29
Martin-Löf's type theory as an open-ended framework
Yasuyuki Tsukada
International Journal of Foundations of Computer Science
12
(1), 2001, pp. 31-67
Rewriting with strategies in ELAN: A functional semantics
Peter Borovanský
,
Claude Kirchner
,
Héléne Kirchner
,
Christophe Ringeissen
International Journal of Foundations of Computer Science
12
(1), 2001, pp. 69-95
Automatic result verification by complete run-time checking of computations
Edgar F.A. Lederer
,
Romeo A. Dumitrescu
International Journal of Foundations of Computer Science
12
(1), 2001, pp. 97-124
Prolog's control constructs in a functional setting - Axioms and implementation
Ralf Hinze
International Journal of Foundations of Computer Science
12
(2), 2001, pp. 125-170
From standard to non-standard semantics by semantics modifiers
Sergei Abramov
,
Robert Glück
International Journal of Foundations of Computer Science
12
(2), 2001, pp. 171-211
Categorical model construction for proving syntactic properties
Takafumi Sakurai
International Journal of Foundations of Computer Science
12
(2), 2001, pp. 213-244
Special issue on parallel and distributed computing
Michael A. Palis
International Journal of Foundations of Computer Science
12
(3), 2001, pp. 245-247
Models and algorithms for optical and optoelectronic parallel computers
Sartaj Sahni
International Journal of Foundations of Computer Science
12
(3), 2001, pp. 249-264
Efficient parallel job scheduling using gang service
Fabricio Alves Barbosa da Silva
,
Isaac D. Scherson
International Journal of Foundations of Computer Science
12
(3), 2001, pp. 265-284
On message packaging in task scheduling for distributed memory parallel machines
Noriyuki Fujimoto
,
Tomoki Baba
,
Takashi Hashimoto
,
Kenichi Hagihara
International Journal of Foundations of Computer Science
12
(3), 2001, pp. 285-306
Load balancing in home-based software DSMS
Weisong Shi
,
Zhimin Tang
International Journal of Foundations of Computer Science
12
(3), 2001, pp. 307-324
Performance evaluation of practical parallel computer model LogPQ
Takayoshi Touyama
,
Susumu Horiguchi
International Journal of Foundations of Computer Science
12
(3), 2001, pp. 325-340
Using stochastic information to predict application behavior on contended resources
Jennifer M. Schopf
,
Francine Berman
International Journal of Foundations of Computer Science
12
(3), 2001, pp. 341-363
Randomized mobile agent based routing in wireless networks
Marc Bui
,
Sajal K. Das
,
Ajoy K. Datta
,
Dai Tho Nguyen
International Journal of Foundations of Computer Science
12
(3), 2001, pp. 365-384
A non-definability result for a predicational language with the usual control
Birgit Elbl
International Journal of Foundations of Computer Science
12
(3), 2001, pp. 385-396
Closure property of probabilistic Turing machines and alternating Turing machines with sublogarithmic spaces
Géza Harváth
,
Katsushi Inoue
,
Akira Ito
,
Yue Wang
International Journal of Foundations of Computer Science
12
(3), 2001, pp. 397-409
On the routing number of complete
d
-ary trees
Alan Roberts
,
Antonios Symvonis
International Journal of Foundations of Computer Science
12
(4), 2001, pp. 411-434
A characterization of
k
-th powers
P_{n,k}
of paths in terms of
k
-trees
Koich Yamazaki
,
Sei'ichi Tani
,
Tetsuro Nishino
International Journal of Foundations of Computer Science
12
(4), 2001, pp. 435-443
An algorithm for finding longest cycles in certain bipartite graphs
Pak-Ken Wong
International Journal of Foundations of Computer Science
12
(4), 2001, pp. 445-454
Variants of
(A,B)
-trees with relaxed balance
Lars Jacobsen
,
Kim S. Larsen
International Journal of Foundations of Computer Science
12
(4), 2001, pp. 455-478
Coding with minimal programs
Cristian S. Calude
,
Hajime Ishihara
,
Takeshi Yamaguchi
International Journal of Foundations of Computer Science
12
(4), 2001, pp. 479-489
Derandomized learning of Boolean functions over finite Abelian groups
M. Sitharam
,
Timothy Straney
International Journal of Foundations of Computer Science
12
(4), 2001, pp. 491-516
Remarks on a query-based variant of the parallel repetition theorem
Oleg Verbitsky
International Journal of Foundations of Computer Science
12
(4), 2001, pp. 517-531
Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees
Wing-Kai Hon
,
Tak-Wah Lam
International Journal of Foundations of Computer Science
12
(4), 2001, pp. 533-550
Seiten 1
2
>