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 Volume=113
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Membership testing in threshold one transformation monoids
M. Beaudry
Information and Computation
113
(1), 1994, August, pp. 1-25
On the decidability of certain integer subgraph problems on context-free graph languages
Egon Wanke
Information and Computation
113
(1), 1994, August, pp. 26-49
The vertex separation and search number of a graph
J.A. Ellis
,
I.H. Sudborough
,
J.S. Turner
Information and Computation
113
(1), 1994, August, pp. 50-79
Calling names on nameless networks
Baruch Schieber
,
Marc Snir
Information and Computation
113
(1), 1994, August, pp. 80-101
A resource-based prioritized bisimulation for real-time systems
Richard Gerber
,
Insup Lee
Information and Computation
113
(1), 1994, August, pp. 102-142
An efficient incremental algorithm for solving systems of linear diophantine equations
Evelyne Contejean
,
Hervé Devie
Information and Computation
113
(1), 1994, August, pp. 143-172
Impossibility results in the presence of multiple faulty processes
Gadi Taubenfeld
,
Shmuel Katz
,
Shlomo Moran
Information and Computation
113
(2), 1994, September, pp. 173-198
Virtual shared memory: Algorithms and complexity
Andrew Chin
,
W.F. McColl
Information and Computation
113
(2), 1994, September, pp. 199-219
Minimal samples of positive examples identifying
k
-CNF boolean functions
Andrew T. Ogielski
Information and Computation
113
(2), 1994, September, pp. 220-229
Composite geometric concepts and polynomial predictability
Philip M. Long
,
Manfred K. Warmuth
Information and Computation
113
(2), 1994, September, pp. 230-252
Conditional lambda-theories and the verification of static properties of programs
Mitchell Wand
,
Zheng-Yu Wang
Information and Computation
113
(2), 1994, September, pp. 253-277
Deciding emptiness for stack automata on infinite trees
David Harel
,
Danny Raz
Information and Computation
113
(2), 1994, September, pp. 278-299
Simple translation-invariant concepts are hard to learn
Mark Jerrum
Information and Computation
113
(2), 1994, September, pp. 300-311
Elections in anonymous networks
Yehuda Afek
,
Yossi Matias
Information and Computation
113
(2), 1994, September, pp. 312-330
Numeration systems, linear recurrences, and regular sets
Jeffrey Shallit
Information and Computation
113
(2), 1994, September, pp. 331-347