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=6
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Higher-order analysis of 2-3 trees
Ricardo A. Baeza-Yates
,
Patricio V. Poblete
International Journal of Foundations of Computer Science
6
(1), 1995, pp. 1-10
Flat backtracking PROLOG for databases: A formal semantics, the computational complexity and the expressibility
Ilmir Kh. Musikaev
,
Mikhail A. Taitslin
International Journal of Foundations of Computer Science
6
(1), 1995, pp. 11-26
What is the logic of parallel processing?
Jaakko Hintikka
,
Gabriel Sandu
International Journal of Foundations of Computer Science
6
(1), 1995, pp. 27-49
When is a category of many-sorted partial algebras Cartesian-closed?
M. Monserrat
,
F. Rosselló
,
J. Torrens
International Journal of Foundations of Computer Science
6
(1), 1995, pp. 51-66
Bipartitioning into overlapping sets
James Haralambides
,
Spyros Tragoudas
International Journal of Foundations of Computer Science
6
(1), 1995, pp. 67-88
An infinite class of functions identifiable using minimal programs in all Kolmogorov numberings
Sanjay Jain
International Journal of Foundations of Computer Science
6
(1), 1995, pp. 89-94
Some equational laws of initiality in 2CCC'S
Stephen L. Bloom
,
Zoltán Ésik
International Journal of Foundations of Computer Science
6
(2), 1995, pp. 95-118
Evidence theory based on general consequence relations
Philippe Besnard
,
Jürg Kohlas
International Journal of Foundations of Computer Science
6
(2), 1995, pp. 119-135
On helping and interactive proof systems
V. Arvind
,
J. Köbler
,
R. Schuler
International Journal of Foundations of Computer Science
6
(2), 1995, pp. 137-153
Optimum schedule problems in store and forward networks
Andrea Clementi
,
Miriam di Ianni
International Journal of Foundations of Computer Science
6
(2), 1995, pp. 155-168
A new type of pushdown automata on infinite trees
Wuxu Peng
,
S. Purushothaman Iyer
International Journal of Foundations of Computer Science
6
(2), 1995, pp. 169-186
A new formalization of Feferman's system of functions and classes and its relation to Frege structure
Susumu Hayashi
,
Satoshi Kobayashi
International Journal of Foundations of Computer Science
6
(3), 1995, pp. 187-202
A type-free theory of half-monotone inductive definitions
Yukiyoshi Kemeyama
International Journal of Foundations of Computer Science
6
(3), 1995, pp. 203-234
Hybrid partial-total type theory
Scott F. Smith
International Journal of Foundations of Computer Science
6
(3), 1995, pp. 235-263
Reasoning about object systems in VTLoE
Ian Mason
,
Carolyn Talcott
International Journal of Foundations of Computer Science
6
(3), 1995, pp. 265-298
Using nonstandard analysis to ensure the corrrectness of symbolic computations
Michael Beeson
International Journal of Foundations of Computer Science
6
(3), 1995, pp. 299-338
A note on the asymptotic probabilities of existential second-order minimal Gödel sentences with equality
Wiesƚaw Szwast
International Journal of Foundations of Computer Science
6
(4), 1995, pp. 339-351
Observing distribution in processes: Static and dynamic localities
Ilaria Castellani
International Journal of Foundations of Computer Science
6
(4), 1995, pp. 353-393
How to simulate Turing machines by invertible one-dimensional cellular automata
Jean-Christopher Dubacq
International Journal of Foundations of Computer Science
6
(4), 1995, pp. 395-402
Nondeterministically selective sets
Lane A. Hemaspaandra
,
Albrecht Hoene
,
Ashish V. Naik
,
Mitsunori Ogihara
,
Alan L. Selman
,
Thomas Thierauf
,
Jie Wang
International Journal of Foundations of Computer Science
6
(4), 1995, pp. 403-416
The Quine-Bernays combinatory calculus
N. Raja
,
R.K. Shyamasundar
International Journal of Foundations of Computer Science
6
(4), 1995, pp. 417-430
On the power of one-way globally deterministic synchronized alternating Turing machines and multihead automata
Anna Slobodová
International Journal of Foundations of Computer Science
6
(4), 1995, pp. 431-446