( en | de | ru )

 

Disambiguation of "Segoufin, Luc"

Author of the publication

copydeleteadd this publication to your clipboard
Nondeterminism and An Abstract Formulation of Nečiporuk's Lower Bound Method.

, , , and . ACM Trans. Comput. Theory, 9 (1): 5:1-5:34 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Luc Segoufin

Luc Turmes

Luc Buatois

Luc Ardaillon

Luc Poittevin

 

Other publications of authors with the same name

Verification of database-driven systems via amalgamation., , and . PODS, page 63-74. ACM, (2013)Building a constraint-based spatial database system: model, languages, and implementation., , , and . Inf. Syst., 28 (6): 563-595 (2003)Locality from Circuit Lower Bounds., , , and . Electron. Colloquium Comput. Complex., (2011)Tameness and the power of programs over monoids in DA., , and . CoRR, (2021)Towards a Characterization of Order-Invariant Queries over Tame Structures., and . CSL, volume 3634 of Lecture Notes in Computer Science, page 276-291. Springer, (2005)Automata and Logics for Words and Trees over an Infinite Alphabet.. CSL, volume 4207 of Lecture Notes in Computer Science, page 41-57. Springer, (2006)Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates., , , and . ICALP (2), volume 6756 of Lecture Notes in Computer Science, page 368-379. Springer, (2011)Representing and Querying XML with Incomplete Information., , and . PODS, ACM, (2001)FO2(<, +1, ~) on data trees, data tree automata and branching vector addition systems., , and . Logical Methods in Computer Science, (2016)Regular Tree Languages Definable in FO., and . STACS, volume 3404 of Lecture Notes in Computer Science, page 327-339. Springer, (2005)