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=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Connected graph searching
Lali Barrière
,
Paola Flocchini
,
Fedor V. Fomin
,
Pierre Fraigniaud
,
Nicolas Nisse
,
Nicola Santoro
,
Dimitrios M. Thilikos
Information and Computation
219
, 2012, pp. 1-16
Approximate counting for complex-weighted Boolean constraint satisfaction problems
Tomoyuki Yamakami
Information and Computation
219
, 2012, pp. 17-38
Efficient algorithms for the conditional covering problem
Robert Benkoczi
,
Binay Bhattacharya
,
Yuzhuang Hu
,
Chien-Hsin Lin
,
Qiaosheng Shi
,
Biing-Feng Wang
Information and Computation
219
, 2012, pp. 39-57
Consecutive ones property and PQ-trees for multisets: Hardness of counting their orderings
Giovanni Battaglia
,
Roberto Grossi
,
Noemi Scutellà
Information and Computation
219
, 2012, pp. 58-70
The Church problem for expansions of
(\mathbb N,<)
by unary predicates
Alexander Rabinovich
Information and Computation
218
, 2012, pp. 1-16
Automatic learning of subclasses of pattern languages
John Case
,
Sanjay Jain
,
Trong Dao Le
,
Yuh Shin Ong
,
Pavel Semukhin
,
Frank Stephan
Information and Computation
218
, 2012, pp. 17-35
On the complexity of minimizing probabilistic and quantum automata
Paulo Mateus
,
Daowen Qiu
,
Lvzhou Li
Information and Computation
218
, 2012, pp. 36-53
EXPTIME-completeness of thorough refinement on modal transition systems
Nikola Benes̑
,
Jan Kȓetínský
,
Kim G. Larsen
,
Jiȓí Srba
Information and Computation
218
, 2012, pp. 54-68
The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types
Ken-etsu Fujita
,
Aleksy Schubert
Information and Computation
218
, 2012, pp. 69-87
The isomorphism problem for
k
-trees is complete for logspace
V. Arvind
,
Bireswar Das
,
Johannes Köbler
,
Sebastian Kuhnert
Information and Computation
217
, 2012, pp. 1-11
Deciding regularity of hairpin completions of regular languages in polynomial time
Volker Diekert
,
Steffen Kopecki
,
Victor Mitrana
Information and Computation
217
, 2012, pp. 12-30
Functorial data migration
David I. Spivak
Information and Computation
217
, 2012, pp. 31-51
Fundamentals of session types
Vasco T. Vasconcelos
Information and Computation
217
, 2012, pp. 52-70
Restricted space algorithms for isomorphism on bounded treewidth graphs
Bireswar Das
,
Jacobo Torán
,
Fabian Wagner
Information and Computation
217
, 2012, pp. 71-83
A robust algorithm for geometric predicate by error-free determinant transformation
Katsuhisa Ozaki
,
Takeshi Ogita
,
Shin'ichi Oishi
Information and Computation
216
, 2012, pp. 3-13
Floating-point arithmetic in the Coq system
Guillaume Melquiond
Information and Computation
216
, 2012, pp. 14-23
Interrogating witnesses for geometric constraint solving
Sebti Foufou
,
Dominique Michelucci
Information and Computation
216
, 2012, pp. 24-38
The world's shortest correct exact real arithmetic program?
David R. Lester
Information and Computation
216
, 2012, pp. 39-46
A study of decimal left shifters for binary numbers
Sonia Gonzalez-Navarro
,
Javier Hormigo
,
Michael J. Schulte
Information and Computation
216
, 2012, pp. 47-56
Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
Stef Graillat
,
Valérie Ménissier-Morain
Information and Computation
216
, 2012, pp. 57-71
The functions erf and erfc computed with arbitrary precision and explicit error bounds
S. Chevillard
Information and Computation
216
, 2012, pp. 72-95
Green's theorem and isolation in planar graphs
Raghunath Tewari
,
N.V. Vinodchandran
Information and Computation
215
, 2012, pp. 1-7
On the complexity of entailment in existential conjunctive first-order logic with atomic negation
Marie-Laure Mugnier
,
Geneviève Simonet
,
Michaël Thomazo
Information and Computation
215
, 2012, pp. 8-31
Non-uniform cellular automata: Classes, dynamics, and decidability
Alberto Dennunzio
,
Enrico Formenti
,
Julien Provillard
Information and Computation
215
, 2012, pp. 32-46
A new look at the automatic synthesis of linear ranking functions
Roberto Bagnara
,
Fred Mesnard
,
Andrea Pescetti
,
Enea Zaffanella
Information and Computation
215
, 2012, pp. 47-67
Seiten 1
2
3
>