( en | de | ru )

 

Disambiguation of "Guessarian, Irène"

Author of the publication

copydeleteadd this publication to your clipboard
The algebra of binary trees is affine complete.

, , , and . CoRR, (2020)

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.

Irène Waldspurger

Irène Baccelli

Irène Alexandrescu

Irène Marcovici

Irène Alexandrescu

 

Other publications of authors with the same name

Affine completeness of some free binary algebras., , and . CoRR, (2021)On the Axiomatization of "If-Then-Else"., and . SIAM J. Comput., 16 (2): 332-357 (1987)Normalization of Some Extended Abstract State Machines., and . Fields of Logic and Computation, volume 6300 of Lecture Notes in Computer Science, page 165-180. Springer, (2010)A characterization of fair computations of finite state SCCS processes.. Formal Properties of Finite Automata and Applications, volume 386 of Lecture Notes in Computer Science, page 234-248. Springer, (1988)About Boundedness for some DATALOG and DATALOG_neg Programs., and . MFCS, volume 629 of Lecture Notes in Computer Science, page 284-297. Springer, (1992)Improving Fixpoint Toole for Computer Science.. IFIP Congress, page 1109-1114. North-Holland/IFIP, (1989)The algebra of binary trees is affine complete., , , and . CoRR, (2020)Window-Accumulated Subsequence Matching Problem is Linear., , , and . PODS, page 327-336. ACM Press, (1999)Semantic Equivalence of Program Schemes and its Syntactic Characterization.. ICALP, page 189-200. Edinburgh University Press, (1976)The Expressiveness of Datalog Circuits (DAC)., , and . MFCS, volume 1295 of Lecture Notes in Computer Science, page 119-128. Springer, (1997)