( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Dummy Elimination: Making Termination Easier.

, и . FCT, том 965 из Lecture Notes in Computer Science, стр. 243-252. Springer, (1995)

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.

Ana Hanstedt

Beurteilung der Entwicklungskompetenz boviner Oozyten aus Follikeln mit unterschiedlicher Durchblutung der Follikelwand. TierH Hannover, (2009)

Flemming Hansen

Standards in der sozialen Arbeit. Uni Kassel, (2009)

Patrick Hansen

Entwicklung eines energetischen Sanierungsmodells für den europäischen Wohngebäudesektor unter dem Aspekt der Erstellung von Szenarien für Energie- und Co_1tn2-Einsparpotenziale bis 2030. Uni Siegen, (2009)

Otto Hansen

Brunhilde Hansen

 

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

Deadlock in Packet Switching Networks., , и . FSEN, том 12818 из Lecture Notes in Computer Science, стр. 127-141. Springer, (2021)Liveness in Rewriting., и . RTA, том 2706 из Lecture Notes in Computer Science, стр. 321-336. Springer, (2003)Simulating liveness by reduction strategies., и . WRS, том 86 из Electronic Notes in Theoretical Computer Science, стр. 641-656. Elsevier, (2003)A Transformational Approach to Prove Outermost Termination Automatically., и . WRS@RTA, том 237 из Electronic Notes in Theoretical Computer Science, стр. 3-21. Elsevier, (2008)Minimizing Sums of Addition Chains.. J. Algorithms, 12 (2): 281-307 (1991)Generalized Innermost Rewriting., и . RTA, том 3467 из Lecture Notes in Computer Science, стр. 2-16. Springer, (2005)Solving Computational Problems in the Theory of Word-Representable Graphs., , , и . J. Integer Seq., 22 (2): 19.2.5 (2019)Syntactical Analysis of Total Termination., и . ALP, том 850 из Lecture Notes in Computer Science, стр. 204-222. Springer, (1994)The Degree of Squares is an Atom., , , и . WORDS, том 9304 из Lecture Notes in Computer Science, стр. 109-121. Springer, (2015)Well-foundedness of Term Orderings., и . CTRS, том 968 из Lecture Notes in Computer Science, стр. 106-123. Springer, (1994)