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
[1]
Hilfe
Suche: Author="Benedikt, Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The per-character cost of repairing word languages
Michael Benedikt
,
Gabriele Puppis
,
Cristian Riveros
Theoretical Computer Science
539
, 2014, pp. 38-67
Rewriting guarded negation queries
Vince Bárány
,
Michael Benedikt
,
Balder ten Cate
Lecture Notes in Computer Science
8087
, 2013, pp. 98-110
Complexity of two-variable logic on finite trees
Saguy Benaim
,
Michael Benedikt
,
Witold Charatonik
,
Emanuel Kieroński
,
Rastislav Lenhardt
,
Philip Mazowiecki
,
James Worell
Lecture Notes in Computer Science
7966
, 2013, pp. 74-88
Determinacy and rewriting of top-down and MSO tree transformations
Michael Benedikt
,
Joost Engelfriet
,
Sebastian Maneth
Lecture Notes in Computer Science
8087
, 2013, pp. 146-158
Bounded repairability of word languages
Michael Benedikt
,
Gabriele Puppis
,
Cristian Riveros
Journal of Computer and System Sciences
79
(8), 2013, pp. 1302-1321
Monadic datalog containment
Michael Benedikt
,
Pierre Bourhis
,
Pierre Senellart
Lecture Notes in Computer Science
7392
, 2012, pp. 79-91
The cost of traveling between languages
Michael Benedikt
,
Gabriele Puppis
,
Cristian Riveros
Lecture Notes in Computer Science
6756
, 2011, pp. 234-245
XPath satisfiability in the presence of DTDs
Michael Benedikt
,
Wenfei Fan
,
Floris Geerts
Journal of the ACM
55
(2), 2008, pp. 8: 1-79
Efficient and expressive tree filters
Michael Benedikt
,
Alan Jeffrey
Lecture Notes in Computer Science
4855
, 2007, pp. 461-472
Interpreting tree-to-tree queries
Michael Benedikt
,
Christoph Koch
Lecture Notes in Computer Science
4052
, 2006, pp. 552-564
A characterization of first-order topological properties of planar spatial data
Michael Benedikt
,
Bart Kuijpers
,
Christof Löding
,
Jan Van den Bussche
,
Thomas Wilke
Journal of the ACM
53
(2), 2006, pp. 273-305
Structural properties of XPath fragments
Michael Benedikt
,
Wenfei Fan
,
Gabriel Kuper
Theoretical Computer Science
336
(1), 2005, pp. 3-31
Regular tree languages definable in
FO
Michael Benedikt
,
Luc Segoufin
Lecture Notes in Computer Science
3404
, 2005, pp. 327-339
Reachability and connectivity queries in constraint databases
Michael Benedikt
,
Martin Grohe
,
Leonid Libkin
,
Luc Segoufin
Journal of Computer and System Sciences
66
(1), 2003, pp. 169-206
Definable relations and first-order query languages over strings
Michael Benedikt
,
Leonid Libkin
,
Thomas Schwentick
,
Luc Segoufin
Journal of the ACM
50
(5), 2003, pp. 694-751
Aggregate operators in constraint query languages
Michael Benedikt
,
Leonid Libkin
Journal of Computer and System Sciences
64
(3), 2002, pp. 628-654
Model checking of unrestricted hierarchical state machines
Michael Benedikt
,
Patrice Godefroid
,
Thomas Reps
Lecture Notes in Computer Science
2076
, 2001, pp. 652-666
Relational queries over interpreted structures
Michael Benedikt
,
Leonid Libkin
Journal of the ACM
47
(4), 2000, pp. 644-680
Safe constraint queries
Michael Benedikt
,
Leonid Libkin
SIAM Journal on Computing
29
(5), 2000, pp. 1652-1682
Relational expressive power of constraint query languages
Michael Benedikt
,
Guozhu Dong
,
Leonid Libkin
,
Limsoon Wong
Journal of the ACM
45
(1), 1998, pp. 1-34
Verifiable properties of database transactions
Michael Benedikt
,
Timothy Griffin
,
Leonid Libkin
Information and Computation
147
(1), 1998, pp. 57-88