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=207
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Objects and session types
Mariangiola Dezani-Ciancaglini
,
Sophia Drossopoulou
,
Dimitris Mostrous
,
Nobuko Yoshida
Information and Computation
207
(5), 2009, pp. 595-641
A computable approach to measure and integration theory
Abbas Edalat
Information and Computation
207
(5), 2009, pp. 642-659
Semiclassical analysis and sensitivity to initial conditions
Thierry Paul
Information and Computation
207
(5), 2009, pp. 660-669
Reachability is decidable for weakly extended process rewrite systems
Mojmír Kȓetínský
,
Vojtȇch Ȓehák
,
Jan Strejc̑ek
Information and Computation
207
(6), 2009, pp. 671-680
Partitioned PLTL model-checking for refined transition systems
J. Julliand
,
P.-A. Masson
,
E. Oudot
Information and Computation
207
(6), 2009, pp. 681-698
Quantifying information leakage in process calculi
Michele Boreale
Information and Computation
207
(6), 2009, pp. 699-725
Recasting ML
^{\mbox F}
Didier Le Botlan
,
Didier Rémy
Information and Computation
207
(6), 2009, pp. 726-785
A zero-one law for RP and derandomization of AM if
NP
is not small
Russell Impagliazzo
,
Philippe Moser
Information and Computation
207
(7), 2009, pp. 787-792
Axiomatizing rational power series over natural numbers
S.L. Bloom
,
Z. Ésik
Information and Computation
207
(7), 2009, pp. 793-811
Undecidable equivalences for basic parallel processes
Hans Hüttel
,
Naoki Kobayashi
,
Takashi Suto
Information and Computation
207
(7), 2009, pp. 812-829
Computability of probability measures and Martin-Löf randomness over metric spaces
Mathieu Hoyrup
,
Cristóbal Rojas
Information and Computation
207
(7), 2009, pp. 830-847
The myriad virtues of Wavelet Trees
Paolo Ferragina
,
Raffaele Giancarlo
,
Giovanni Manzini
Information and Computation
207
(8), 2009, pp. 849-866
Data-complexity of the two-variable fragment with counting quantifiers
Ian Pratt-Hartmann
Information and Computation
207
(8), 2009, pp. 867-888
Improving the round complexity of VSS in point-to-point networks
Jonathan Katz
,
Chiu-Yuen Koo
,
Ranjit Kumaresan
Information and Computation
207
(8), 2009, pp. 889-899
The equality problem for infinite words generated by primitive morphisms
Juha Honkala
Information and Computation
207
(8), 2009, pp. 900-907
On fairness and randomness
Manfred Jaeger
Information and Computation
207
(9), 2009, pp. 909-922
The complexity of constraint satisfaction games and QCSP
F. Börner
,
A. Bulatov
,
H. Chen
,
P. Jeavons
,
A. Krokhin
Information and Computation
207
(9), 2009, pp. 923-944
Well-founded semantics for Boolean grammars
Vassilis Kountouriotis
,
Christos Nomikos
,
Panos Rondogiannis
Information and Computation
207
(9), 2009, pp. 945-967
Operational set theory and small large cardinals
Solomon Feferman
Information and Computation
207
(10), 2009, pp. 971-979
Situations in LTL as strings
Tim Fernando
Information and Computation
207
(10), 2009, pp. 980-999
On graph reasoning
Renata de Freitas
,
Paulo A.S. Veloso
,
Sheila R.M. Veloso
,
Petrucio Viana
Information and Computation
207
(10), 2009, pp. 1000-1014
Propositional games with explicit strategies
Bryan Renne
Information and Computation
207
(10), 2009, pp. 1015-1043
Relating state-based and process-based concurrency through linear logic (full-version)
Iliano Cervesato
,
Andre Scedrov
Information and Computation
207
(10), 2009, pp. 1044-1077
Some specially formulated axiomizations for I
\Sigma_0
manage to evade the Herbrandized version of the Second Incompleteness Theorem
Dan E. Willard
Information and Computation
207
(10), 2009, pp. 1078-1093
Detecting palindromes, patterns and borders in regular languages
Terry Anderson
,
John Loftus
,
Narad Rampersad
,
Nicolae Santean
,
Jeffrey Shallit
Information and Computation
207
(11), 2009, pp. 1096-1118
Seiten
<
1
2
3
>