( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference.

, , и . CoRR, (2014)

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.

Mohamed Ahmed Tony Ahmed Marzok

Hans-Peter Tony

Tony Franken

Tony Noll

Tony Mudrack

 

Другие публикации лиц с тем же именем

Parallel Evaluation of Multi-Semi-Joins., , , и . Proc. VLDB Endow., 9 (10): 732-743 (2016)Subsequence versus substring constraints in sequence pattern languages., , и . Acta Informatica, 58 (1-2): 35-56 (2021)Tree Automata over Infinite Alphabets., и . Pillars of Computer Science, том 4800 из Lecture Notes in Computer Science, стр. 386-423. Springer, (2008)Regular Expressions for Languages over Infinite Alphabets., и . Fundam. Informaticae, 69 (3): 301-318 (2006)Efficient reasoning about data trees via integer linear programming., , и . ICDT, стр. 18-29. ACM, (2011)Efficient reasoning about data trees via integer linear programming., , и . ACM Trans. Database Syst., 37 (3): 19:1-19:28 (2012)Two Variable Logic with Ultimately Periodic Counting., , и . ICALP, том 168 из LIPIcs, стр. 112:1-112:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Distributed Streaming with Finite Memory., , , и . ICDT, том 31 из LIPIcs, стр. 324-341. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)On the Complexity of k-DQBF., и . SAT, том 271 из LIPIcs, стр. 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Reducing NEXP-complete problems to DQBF., , , и . FMCAD, стр. 199-204. IEEE, (2022)