( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Automata Based Interfaces for Control and Scheduling.

, и . HSCC, том 4416 из Lecture Notes in Computer Science, стр. 601-613. Springer, (2007)

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.

Rajeev Sudra

Naresh Kumar Aluri

Rajeev Gangula

Sirisha Aluri

Bhaskar Reddy Aluri

 

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

Branching Pushdown Tree Automata., и . FSTTCS, том 4337 из Lecture Notes in Computer Science, стр. 393-404. Springer, (2006)Synthesis Through Unification., , и . CAV (2), том 9207 из Lecture Notes in Computer Science, стр. 163-179. Springer, (2015)How Can Automatic Feedback Help Students Construct Automata?, , , , , и . ACM Trans. Comput. Hum. Interact., 22 (2): 9:1-9:24 (2015)Adding nesting structure to words, и . Journal of the ACM, 56 (3): 16:1--16:43 (2009)Contention-free Complexity of Shared Memory Algorithms., и . PODC, стр. 61-70. ACM, (1994)Exploiting Hierarchical Structure for Efficient Formal Verification.. CONCUR, том 1877 из Lecture Notes in Computer Science, стр. 66-68. Springer, (2000)Model Checking of Message Sequence Charts., и . CONCUR, том 1664 из Lecture Notes in Computer Science, стр. 114-129. Springer, (1999)Transducer-Based Algorithmic Verification of Retransmission Protocols over Noisy Channels., , и . FMOODS/FORTE, том 7892 из Lecture Notes in Computer Science, стр. 209-224. Springer, (2013)Colored Nested Words., и . LATA, том 9618 из Lecture Notes in Computer Science, стр. 143-155. Springer, (2016)Modular Strategies for Infinite Games on Recursive Graphs., , и . CAV, том 2725 из Lecture Notes in Computer Science, стр. 67-79. Springer, (2003)