( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Rank and simulation: the well-founded case.

, , и . J. Log. Comput., 25 (6): 1331-1349 (2015)

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.

Alberto Moreira

Alberto Coda

Alberto Fierro

Alberto Calabrò

Alberto Rorai

 

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

Che Genere di Insiemi/Multi-insiemi/Iper-insiemi Incorporare nella Programazione Logica?, , и . GULP, стр. 55-70. (1993)Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform., , и . LATA, том 8977 из Lecture Notes in Computer Science, стр. 587-598. Springer, (2015)Biconnectivity on Symbolically Represented Graphs: A Linear Solution., и . ISAAC, том 2906 из Lecture Notes in Computer Science, стр. 554-564. Springer, (2003)Stochastic Concurrent Constraint Programming and Differential Equations., и . QAPL, том 190 из Electronic Notes in Theoretical Computer Science, стр. 27-42. Elsevier, (2007)Power (Set) ALC (Extended Abstract)., и . CILC, том 2214 из CEUR Workshop Proceedings, стр. 17-21. CEUR-WS.org, (2018)Logic Programming Applied to Genome Evolution in Cancer., , , , и . CILC, том 1645 из CEUR Workshop Proceedings, стр. 148-157. CEUR-WS.org, (2016)On (co-lex) Ordering Automata., , , и . CoRR, (2021)The Importance of Being (A Little Bit) Discrete., и . FBTC@ICALP, том 229 из Electronic Notes in Theoretical Computer Science, стр. 75-92. Elsevier, (2008)Well-Quasi-Ordering Hereditarily Finite Sets., и . LATA, том 6638 из Lecture Notes in Computer Science, стр. 440-451. Springer, (2011)The axiom of elementary sets on the edge of Peircean expressibility., , и . J. Symb. Log., 70 (3): 953-968 (2005)