( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring.

, , и . Distributed Comput., 29 (5): 377-393 (2016)

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.

Tanja Elisabeth Peters

George Gershwins und Jerome Kerns Musicalsongs: ihre Ähnlichkeit, Wahrnehmung und musikalische Struktur. Uni Köln, (2008)

Andre Peters

Description and determination of soil hydraulic properties on the laboratory scale. TU Braunschweig, (2008)

Jillian Petersen

Diversity and ecology of chemosynthetic symbioses in deep-sea invertebrates. Uni Bremen, (2009)

Robert Martin Peterreins

Musikhörfähigkeit von Patienten mit elektroakustischer Stimulation: Testung anhand des Mu.S.I.C.-Tests. TU München, (2009)

Franziska Julia Peter

 

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

Decomposing Constraint Satisfaction Problems Using Database Techniques., , и . Artif. Intell., 66 (1): 57-89 (1994)Classes of Submodular Constraints Expressible by Graph Cuts., и . CP, том 5202 из Lecture Notes in Computer Science, стр. 112-127. Springer, (2008)Steering Evolution with Sequential Therapy to Prevent the Emergence of Bacterial Antibiotic Resistance, , , , , , , , и . PLoS Comput Biol, 11 (9): e1004493+ (11.09.2015)Quantified Constraints: Algorithms and Complexity., , , и . CSL, том 2803 из Lecture Notes in Computer Science, стр. 58-70. Springer, (2003)Finding Graph Decompositions via SAT., , , и . ICTAI, стр. 131-138. IEEE Computer Society, (2017)Learnability of Quantified Formulas., и . EuroCOLT, том 1572 из Lecture Notes in Computer Science, стр. 63-78. Springer, (1999)A Maximal Tractable Class of Soft Constraints., , , и . IJCAI, стр. 209-214. Morgan Kaufmann, (2003)The Complexity of Constraints on Intervals and Lengths., , и . STACS, том 2285 из Lecture Notes in Computer Science, стр. 443-454. Springer, (2002)The complexity of maximal constraint languages., , и . STOC, стр. 667-674. ACM, (2001)A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition., , и . IJCAI, стр. 72-77. Professional Book Center, (2005)