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=Theor.~Comput.~Sci. AND YEAR=1992
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multimodal logic programming using equational and order-sorted logic
Françoise Debart
,
Patrice Enjalbert
,
Madeleine Lescot
Theoretical Computer Science
105
, 1992, pp. 141-166
Inferring the equivalence of functional programs that mutate data
Ian Mason
,
Carolyn Talcott
Theoretical Computer Science
105
, 1992, pp. 167-215
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations
Joseph A. Goguen
,
José Meseguer
Theoretical Computer Science
105
, 1992, pp. 217-273
Data types with errors and exceptions
Ming-Hua Zhang
Theoretical Computer Science
105
, 1992, pp. 275-299
Generalizing completeness results for loop checks in logic programming
Roland N. Bol
Theoretical Computer Science
104
, 1992, pp. 3-28
Termination and completion modulo associativity, commutativity and identity
Jean-Pierre Jouannaud
,
Claude Marché
Theoretical Computer Science
104
, 1992, pp. 29-51
A semi-algorithm for algebraic implementation proofs
Rolf Hennicker
Theoretical Computer Science
104
, 1992, pp. 53-87
Abstract specification of structures and methods in symbolic mathematical computation
C. Limongelli
,
M. Temperini
Theoretical Computer Science
104
, 1992, pp. 89-107
A Prolog technology theorem prover: a new exposition and implementation in Prolog
Mark E. Stickel
Theoretical Computer Science
104
, 1992, pp. 109-128
A theory for program and data type specification
Carolyn Talcott
Theoretical Computer Science
104
, 1992, pp. 129-159
On a conjecture concerning dot-depth two languages
H. Straubing
,
P. Weil
Theoretical Computer Science
104
, 1992, pp. 161-183
On reversal-bounded picture languages
Changwook Kim
,
Ivan Hal Sudborough
Theoretical Computer Science
104
, 1992, pp. 185-206
Learning semilinear sets from examples and via queries
Yuji Takada
Theoretical Computer Science
104
, 1992, pp. 207-233
A geometric hierarchy beyond context-free languages
David J. Weir
Theoretical Computer Science
104
, 1992, pp. 235-261
A uniform approach to define complexity classes
Daniel P. Bovet
,
Pierluigi Crescenzi
,
Riccardo Silvestri
Theoretical Computer Science
104
, 1992, pp. 263-283
Processor optimization for flow graphs
Klaus Jansen
Theoretical Computer Science
104
, 1992, pp. 285-298
Recursive ascent parsing: From Earley to Marcus
René Leermakers
Theoretical Computer Science
104
, 1992, pp. 299-312
A functional LR-parser
René Leermakers
,
Lex Augusteijn
,
Frans E.J. Kruseman Aretz
Theoretical Computer Science
104
, 1992, pp. 313-323
Counting classes: thresholds, parity, mods, and fewness
Richard Beigel
,
John Gill
Theoretical Computer Science
103
, 1992, pp. 3-23
On games of incomplete information
Jin-yi Cai
,
Anne Condon
,
Richard J. Lipton
Theoretical Computer Science
103
, 1992, pp. 25-38
Semicommutations and algebraic languages
M. Clerbout
,
Y. Roos
Theoretical Computer Science
103
, 1992, pp. 39-49
An algebraic semantics for structured transition systems and its application to logic programs
Andrea Corradini
,
Ugo Montanari
Theoretical Computer Science
103
, 1992, pp. 51-106
Minimum vertex hulls for polyhedral domains
Gautam Das
,
Deborah Joseph
Theoretical Computer Science
103
, 1992, pp. 107-135
Sorting the sums
(x_i + y_j)
in
O(n^2)
comparisons
Jean-Luc Lambert
Theoretical Computer Science
103
, 1992, pp. 137-141
Infinite trees and automaton-definable relations over
\omega
-words
Wolfgang Thomas
Theoretical Computer Science
103
, 1992, pp. 143-159
Seiten
<
1
2
3
4
5
6
7
8
9
>