( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Entwicklung eines Informationsportals für die Informatik.

, , , , , , , , , , , и . GI Jahrestagung (2), том P-51 из LNI, стр. 208-212. GI, (2004)

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.

Ernst Mayr

Ernst Mayr

Ernst Mayr

Ernst Mayr

Ernst Mayr

 

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

Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities., и . Fundam. Informaticae, 143 (3-4): 355-391 (2016)The Complexity of the Finite Containment Problem for Petri Nets., и . J. ACM, 28 (3): 561-576 (1981)Degree bounds for Gröbner bases of low-dimensional polynomial ideals., и . ISSAC, стр. 21-27. ACM, (2010)Space-efficient Gröbner basis computation without degree bounds., и . ISSAC, стр. 257-264. ACM, (2011)Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations., , , и . CASC, том 4770 из Lecture Notes in Computer Science, стр. 102-117. Springer, (2007)Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes., и . IRREGULAR, том 1117 из Lecture Notes in Computer Science, стр. 287-298. Springer, (1996)Distributed Systems and Databases., и . Euro-Par, том 1470 из Lecture Notes in Computer Science, стр. 503-504. Springer, (1998)Membership in Plynomial Ideals over Q Is Exponential Space Complete.. STACS, том 349 из Lecture Notes in Computer Science, стр. 400-406. Springer, (1989)Node Weighted Matching., и . ICALP, том 172 из Lecture Notes in Computer Science, стр. 454-464. Springer, (1984)Efficient Dynamic Embeddings of Binary Trees into Hypercubes., и . J. Algorithms, 43 (1): 51-84 (2002)