| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7788630 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Search on a Line by Byzantine Robots
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Energy consumption of group search on a line
(available as arXiv preprint) | 2022-07-21 | Paper |
Graph exploration by energy-sharing mobile agents
(available as arXiv preprint) | 2022-03-22 | Paper |
Time-energy tradeoffs for evacuation by two robots in the wireless model
Theoretical Computer Science | 2021-01-25 | Paper |
God save the queen
(available as arXiv preprint) | 2020-08-11 | Paper |
Time-energy tradeoffs for evacuation by two robots in the wireless model
Lecture Notes in Computer Science | 2020-03-03 | Paper |
| Satisfying neighbor preferences on a circle | 2020-02-12 | Paper |
Priority evacuation from a disk: the case of \(n = 1,2,3\)
Theoretical Computer Science | 2020-01-16 | Paper |
Priority evacuation from a disk using mobile robots (extended abstract)
(available as arXiv preprint) | 2019-01-30 | Paper |
Search on a line by Byzantine robots
(available as arXiv preprint) | 2018-04-19 | Paper |
Linear Search with Terrain-Dependent Speeds
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Weak coverage of a rectangular barrier
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Distributed algorithms for barrier coverage using relocatable sensors
Distributed Computing | 2017-04-04 | Paper |
Online channel allocation in FDMA networks with reuse constraints
Information Processing Letters | 2016-06-09 | Paper |
Encoding 2D range maximum queries
Theoretical Computer Science | 2015-12-08 | Paper |
Complexity of barrier coverage with relocatable sensors in the plane
Theoretical Computer Science | 2015-05-18 | Paper |
Distributed algorithms for barrier coverage using relocatable sensors
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
A tight characterization of strategic games with a unique equilibrium
Theoretical Computer Science | 2013-11-29 | Paper |
Complexity of barrier coverage with relocatable sensors in the plane
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Approximating the achromatic number problem on bipartite graphs
Lecture Notes in Computer Science | 2010-03-03 | Paper |
| Tracking mobile users in cellular networks using timing information | 2009-10-12 | Paper |
Approximate hotlink assignment
Information Processing Letters | 2009-07-21 | Paper |
Games to induce specified equilibria
Theoretical Computer Science | 2009-01-08 | Paper |
An Improved Approximation of the Achromatic Number on Bipartite Graphs
SIAM Journal on Discrete Mathematics | 2008-05-22 | Paper |
Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers
Structural Information and Communication Complexity | 2007-11-15 | Paper |
| scientific article; zbMATH DE number 2081037 (Why is no real title available?) | 2004-08-04 | Paper |
| Partial characterizations of networks supporting shortest path interval labeling schemes | 2002-07-21 | Paper |
Static frequency assignment in cellular networks
Algorithmica | 2001-10-07 | Paper |
An analysis of some common scanning techniques for lossless image coding
IEEE Transactions on Image Processing | 2001-06-10 | Paper |
Distributed Online Frequency Assignment in Cellular Networks
Journal of Algorithms | 2000-11-22 | Paper |
Pumping lemmas for the control language hierarchy
Mathematical Systems Theory | 1995-06-08 | Paper |
On multidimensional packet routing for meshes with buses
Journal of Parallel and Distributed Computing | 1994-05-15 | Paper |
An NC algorithm for recognizing tree adjoining languages
International Journal of Parallel Programming | 1993-09-30 | Paper |
Upper bounds on recognition of a hierarchy of non-context-free languages
Theoretical Computer Science | 1992-09-27 | Paper |
An Optimal Linear-Time Parallel Parser for Tree Adjoining Languages
SIAM Journal on Computing | 1990-01-01 | Paper |
