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: Author="Pichler, Reinhard"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Belief revision within fragments of propositional logic
Nadia Creignou
,
Odile Papini
,
Reinhard Pichler
,
Stefan Woltran
Journal of Computer and System Sciences
80
(2), 2014, pp. 427-449
Relaxed notions of schema mapping equivalence revisited
Reinhard Pichler
,
Emanuel Sallinger
,
Vadim Savenkov
Theory of Computing Systems
52
(3), 2013, pp. 483-541
Tractable counting of the answers to conjunctive queries
Reinhard Pichler
,
Sebastian Skritek
Journal of Computer and System Sciences
79
(6), 2013, pp. 984-1001
Counting complexity of propositional abduction
Miki Hermann
,
Reinhard Pichler
Journal of Computer and System Sciences
76
(7), 2010, pp. 634-649
Multicut algorithms via tree decompositions
Reinhard Pichler
,
Stefan Rümmele
,
Stefan Woltran
Lecture Notes in Computer Science
6078
, 2010, pp. 167-179
Towards practical feasibility of core computation in data exchange
Reinhard Pichler
,
Vadim Savenkov
Theoretical Computer Science
411
(7-9), 2010, pp. 935-957
Complexity of counting the optimal solutions
Miki Hermann
,
Reinhard Pichler
Theoretical Computer Science
410
(38-40), 2009, pp. 3814-3825
Complexity of counting the optimal solutions
Miki Hermann
,
Reinhard Pichler
Lecture Notes in Computer Science
5092
, 2008, pp. 149-159
Complexity of counting the optimal solutions
Miki Hermann
,
Reinhard Pichler
Lecture Notes in Computer Science
5092
, 2008, pp. 149-159
The complexity of XPath query evaluation and XML typing
Georg Gottlob
,
Christoph Koch
,
Reinhard Pichler
,
Luc Segoufin
Journal of the ACM
52
(2), 2005, pp. 284-335
Hypergraphs in model checking: Acyclicity and hypertree-width versus clique-width
Georg Gottlob
,
Reinhard Pichler
SIAM Journal on Computing
33
(2), 2004, pp. 351-378
On the complexity of equational problems in CNF
Reinhard Pichler
Journal Symbolic Computation
36
(1-2), 2003, pp. 235-269
Explicit versus implicit representations of subsets of the Herbrand universe
Reinhard Pichler
Theoretical Computer Science
290
(1), 2003, pp. 1021-1056
Working with ARMs: Complexity results on atomic representations of Herbrand models
Georg Gottlob
,
Reinhard Pichler
Information and Computation
165
(2), 2001, pp. 183-207
Hypergraphs in model checking: Acyclicity and hypertree-width versus clique-width
Georg Gottlob
,
Reinhard Pichler
Lecture Notes in Computer Science
2076
, 2001, pp. 708-719
Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria
Reinhard Pichler
Journal Symbolic Computation
29
(2), 2000, pp. 213-257
Negation elimination from simple equational formulae
Reinhard Pichler
Lecture Notes in Computer Science
1853
, 2000, pp. 612-623