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=Inf.~Comput. AND YEAR=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decoding choice encodings
Uwe Nestmann
,
Benjamin C. Pierce
Information and Computation
163
(1), 2000, pp. 1-59
Semantics of temporal classes
Suad Alagić
Information and Computation
163
(1), 2000, pp. 60-102
On the impossibility of interaction-free quantum sensing for small I/0 bandwidth
John Reif
Information and Computation
163
(1), 2000, pp. 103-122
Compositionality in dataflow synchronous languages: Specification and distributed code generation
Albert Benveniste
,
Benoît Caillaud
,
Paul le Guernic
Information and Computation
163
(1), 2000, pp. 125-171
An algebraic framework for urgency
Sébastien Bornot
,
Joseph Sifakis
Information and Computation
163
(1), 2000, pp. 172-202
Verification by augmented finitary abstraction
Yonit Kesten
,
Amir Pnueli
Information and Computation
163
(1), 2000, pp. 203-243
Inductive synthesis of recursive processes from logical properties
Shigetomo Kimura
,
Atsushi Togashi
,
Norio Shiratori
Information and Computation
163
(2), 2000, pp. 257-284
On full abstraction for PCF: I, II, and III
J.M.E. Hyland
,
C.-H.L. Ong
Information and Computation
163
(2), 2000, pp. 285-408
Full abstraction for PCF
Samson Abramsky
,
Radha Jagadeesan
,
Pasquale Malacaria
Information and Computation
163
(2), 2000, pp. 409-470
Strong fairness and full abstraction for communicating processes
Susan Older
Information and Computation
163
(2), 2000, pp. 471-509
Uniform generation of
NP
-witnesses using an
NP
-oracle
Mihir Bellare
,
Oded Goldreich
,
Erez Petrank
Information and Computation
163
(2), 2000, pp. 510-526
Complexity of nilpotent unification and matching problems
Qing Guo
,
Paliath Narendran
,
D.A. Wolfram
Information and Computation
162
(1-2), 2000, pp. 3-23
Unification algorithms cannot be combined in polynomial time
Miki Hermann
,
Phokion G. Kolaitis
Information and Computation
162
(1-2), 2000, pp. 24-42
The achievement of knowledge bases by cycle search
Olivier Roussel
,
Philippe Mathieu
Information and Computation
162
(1-2), 2000, pp. 43-58
Automatic acquisition of search control knowledge from multiple proof attempts
Jörg Denzinger
,
Stephan Schulz
Information and Computation
162
(1-2), 2000, pp. 59-79
Structuring metatheory on inductive definitions
David Basin
,
Seán Matthews
Information and Computation
162
(1-2), 2000, pp. 80-95
On terminating lemma speculations
Christoph Walther
,
Thomas Kolbe
Information and Computation
162
(1-2), 2000, pp. 96-116
Combining deduction and model checking into tableaux and algorithms for converse-PDL
Giuseppe de Giacomo
,
Fabio Massacci
Information and Computation
162
(1-2), 2000, pp. 117-137
Efficient model generation through compilation
Heribert Schütz
,
Tim Geisler
Information and Computation
162
(1-2), 2000, pp. 138-157
Building decision procedures for modal logics from propositional decision procedures: The case study of modal K(m)
Fausto Giunchiglia
,
Roberto Sebastiani
Information and Computation
162
(1-2), 2000, pp. 158-178
Partitioning methods for satisfiability testing on large formulas
Tai Joon Park
,
Allen van Gelder
Information and Computation
162
(1-2), 2000, pp. 179-184
Optimal axiomatizations of finitely valued logics
Gernot Salzer
Information and Computation
162
(1-2), 2000, pp. 185-205
Using tableaux to automate the Lambek and other categorial calculi
Saturnino F. Luz
Information and Computation
162
(1-2), 2000, pp. 206-225
A uniform procedure for converting matrix proofs into sequent-style systems
Christoph Kreitz
,
Stephan Schmitt
Information and Computation
162
(1-2), 2000, pp. 226-254
Practically useful variants of definitional translations to normal form
Uwe Egly
,
Thomas Rath
Information and Computation
162
(1-2), 2000, pp. 255-264
Seiten 1
2
3
>