| Publication | Date of Publication | Type |
|---|
Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels. | 2023-12-08 | Paper |
Perpetual maintenance of machines with different urgency requirements Journal of Computer and System Sciences | 2023-10-24 | Paper |
Deterministic size discovery and topology recognition in radio networks with short labels Information and Computation | 2023-05-19 | Paper |
Stable memoryless queuing under contention | 2023-02-03 | Paper |
Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks Structural Information and Communication Complexity | 2022-09-01 | Paper |
Local queuing under contention | 2022-07-21 | Paper |
Stable routing scheduling algorithms in multi-hop wireless networks Theoretical Computer Science | 2022-05-23 | Paper |
Optimal channel utilization with limited feedback Journal of Computer and System Sciences | 2021-04-14 | Paper |
Patrolling a path connecting a set of points with unbalanced frequencies of visits SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
On range and edge capacity in the congested clique SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Subquadratic non-adaptive threshold group testing Journal of Computer and System Sciences | 2020-03-26 | Paper |
Token traversal in ad hoc wireless networks via implicit carrier sensing Theoretical Computer Science | 2020-02-13 | Paper |
Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements | 2020-02-06 | Paper |
Optimal channel utilization with limited feedback Fundamentals of Computation Theory | 2020-01-30 | Paper |
Online packet scheduling under adversarial errors Theoretical Computer Science | 2019-10-18 | Paper |
Deterministic digital clustering of wireless ad hoc networks Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Communication and location discovery in geometric ring networks Information and Computation | 2019-05-02 | Paper |
Connectivity and minimum cut approximation in the broadcast congested clique | 2019-01-30 | Paper |
Communication complexity in vertex partition whiteboard model | 2019-01-30 | Paper |
Distributed Online and Stochastic Queueing on a Multiple Access Channel ACM Transactions on Algorithms | 2018-11-13 | Paper |
Token traversal in ad hoc wireless networks via implicit carrier sensing Structural Information and Communication Complexity | 2018-04-12 | Paper |
MST in \(O(1)\) rounds of congested clique | 2018-03-15 | Paper |
Subquadratic non-adaptive threshold group testing Fundamentals of Computation Theory | 2017-11-22 | Paper |
Deterministic oblivious local broadcast in the SINR model | 2017-11-22 | Paper |
Length-reducing automata (almost) without auxiliary symbols Journal of Automata, Languages and Combinatorics | 2016-09-29 | Paper |
The cost of synchronizing multiple-access channels Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Online packet scheduling under adversarial jamming Approximation and Online Algorithms | 2015-11-20 | Paper |
On the impact of geometry on ad hoc communication in wireless networks Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Efficient algorithms for leader election in radio networks Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
Distributed deterministic broadcasting in uniform-power ad hoc wireless networks Fundamentals of Computation Theory | 2013-08-16 | Paper |
Distributed deterministic broadcasting in wireless networks of weak devices Automata, Languages, and Programming | 2013-08-07 | Paper |
Distributed backbone structure for algorithms in the SINR model of wireless networks Lecture Notes in Computer Science | 2013-03-13 | Paper |
Distributed Online and Stochastic Queuing on a Multiple Access Channel Lecture Notes in Computer Science | 2013-03-13 | Paper |
Growing grammars and length-reducing automata Fundamenta Informaticae | 2012-05-04 | Paper |
Ambiguity by restarting automata International Journal of Foundations of Computer Science | 2010-01-29 | Paper |
Probabilistic length-reducing two-pushdown automata Theory of Computing Systems | 2009-09-18 | Paper |
The Boolean Closure of Growing Context-Sensitive Languages Developments in Language Theory | 2009-03-26 | Paper |
The Boolean closure of growing context-sensitive languages | 2009-02-10 | Paper |
Leftist Grammars Are Non-primitive Recursive Automata, Languages and Programming | 2008-08-19 | Paper |
On the complexity of 2-monotone restarting automata Theory of Computing Systems | 2008-06-06 | Paper |
Sequential monotonicity for restarting automata RAIRO - Theoretical Informatics and Applications | 2008-02-15 | Paper |
On complexity of grammars related to the safety problem Theoretical Computer Science | 2008-01-07 | Paper |
Lower bound technique for length-reducing automata Information and Computation | 2007-09-18 | Paper |
On Complexity of Grammars Related to the Safety Problem Automata, Languages and Programming | 2007-09-11 | Paper |
Leftist grammars and the Chomsky hierarchy Theory of Computing Systems | 2007-09-06 | Paper |
Probabilistic Length-Reducing Automata Lecture Notes in Computer Science | 2007-09-05 | Paper |
SHRINKING RESTARTING AUTOMATA International Journal of Foundations of Computer Science | 2007-04-25 | Paper |
Restarting automata with restricted utilization of auxiliary symbols Theoretical Computer Science | 2007-01-09 | Paper |
Degrees of non-monotonicity for restarting automata Theoretical Computer Science | 2007-01-09 | Paper |
Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata Theoretical Computer Science | 2007-01-09 | Paper |
Implementation and Application of Automata Lecture Notes in Computer Science | 2006-11-13 | Paper |
Fundamentals of Computation Theory Lecture Notes in Computer Science | 2006-10-20 | Paper |
Mathematical Foundations of Computer Science 2005 Lecture Notes in Computer Science | 2006-10-20 | Paper |
Developments in Language Theory Lecture Notes in Computer Science | 2006-06-23 | Paper |
scientific article; zbMATH DE number 2245557 (Why is no real title available?) | 2006-01-10 | Paper |
Developments in Language Theory Lecture Notes in Computer Science | 2005-12-22 | Paper |
Developments in Language Theory Lecture Notes in Computer Science | 2005-12-22 | Paper |
Efficient simulation of synchronous systems by multi-speed systems RAIRO - Theoretical Informatics and Applications | 2005-07-13 | Paper |
scientific article; zbMATH DE number 2182431 (Why is no real title available?) | 2005-06-23 | Paper |
Probabilistic algorithms for the wake-up problem in single-hop radio networks Theory of Computing Systems | 2005-06-14 | Paper |
scientific article; zbMATH DE number 2089983 (Why is no real title available?) | 2004-08-12 | Paper |
scientific article; zbMATH DE number 2090695 (Why is no real title available?) | 2004-08-12 | Paper |
scientific article; zbMATH DE number 2086618 (Why is no real title available?) | 2004-08-11 | Paper |
Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures Combinatorics, Probability and Computing | 2004-06-18 | Paper |
Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards Concurrency and Computation: Practice and Experience | 2003-10-29 | Paper |
scientific article; zbMATH DE number 1979528 (Why is no real title available?) | 2003-09-14 | Paper |
scientific article; zbMATH DE number 1929945 (Why is no real title available?) | 2003-06-18 | Paper |
scientific article; zbMATH DE number 1795910 (Why is no real title available?) | 2002-11-11 | Paper |
scientific article; zbMATH DE number 1754655 (Why is no real title available?) | 2002-06-12 | Paper |
scientific article; zbMATH DE number 1405691 (Why is no real title available?) | 2000-04-03 | Paper |