| 2008 |
|---|
| 28 | EE | Paul Bell,
Igor Potapov:
Periodic and Infinite Traces in Matrix Semigroups.
SOFSEM 2008: 148-161 |
| 27 | EE | Paul Bell,
Igor Potapov:
On undecidability bounds for matrix decision problems.
Theor. Comput. Sci. 391(1-2): 3-13 (2008) |
| 2007 |
|---|
| 26 | EE | Oleksiy Kurganskyy,
Igor Potapov,
Fernando Sancho Caparrini:
Computation in One-Dimensional Piecewise Maps.
HSCC 2007: 706-709 |
| 25 | EE | Paul Bell,
Igor Potapov:
Reachability Problems in Quaternion Matrix and Rotation Semigroups.
MFCS 2007: 346-358 |
| 24 | EE | Leszek Gasieniec,
Aris Pagourtzis,
Igor Potapov,
Tomasz Radzik:
Deterministic Communication in Radio Networks with Large Labels.
Algorithmica 47(1): 97-117 (2007) |
| 23 | EE | Paul Bell,
Igor Potapov:
On the membership of invertible diagonal and scalar matrices.
Theor. Comput. Sci. 372(1): 37-45 (2007) |
| 22 | EE | Leszek Gasieniec,
Igor Potapov,
Qin Xin:
Time efficient centralized gossiping in radio networks.
Theor. Comput. Sci. 383(1): 45-58 (2007) |
| 2006 |
|---|
| 21 | EE | Igor Grunsky,
Oleksiy Kurganskyy,
Igor Potapov:
On a Maximal NFA Without Mergible States.
CSR 2006: 202-210 |
| 20 | EE | Paul Bell,
Igor Potapov:
Lowering Undecidability Bounds for Decision Questions in Matrices.
Developments in Language Theory 2006: 375-385 |
| 19 | EE | Alexei Lisitsa,
Igor Potapov:
In time alone: on the computational power of querying the history.
TIME 2006: 42-49 |
| 2005 |
|---|
| 18 | EE | Leszek Gasieniec,
Roman M. Kolpakov,
Igor Potapov,
Paul Sant:
Real-Time Traversal in Grammar-Based Compressed Files.
DCC 2005: 458 |
| 17 | EE | Paul Bell,
Igor Potapov:
On the Membership of Invertible Diagonal Matrices.
Developments in Language Theory 2005: 146-157 |
| 16 | EE | Igor Grunsky,
Oleksiy Kurganskyy,
Igor Potapov:
Languages Representable by Vertex-Labeled Graphs.
MFCS 2005: 435-446 |
| 15 | EE | Alexei Lisitsa,
Igor Potapov:
Temporal Logic with Predicate lambda-Abstraction.
TIME 2005: 147-155 |
| 14 | EE | Oleksiy Kurganskyy,
Igor Potapov:
Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems.
UC 2005: 169-175 |
| 13 | EE | Leszek Gasieniec,
Roman M. Kolpakov,
Igor Potapov:
Space efficient search for maximal repetitions.
Theor. Comput. Sci. 339(1): 35-48 (2005) |
| 2004 |
|---|
| 12 | EE | Oleksiy Kurganskyy,
Igor Potapov:
On the Computation Power of Finite Automata in Two-dimensional Environments.
Developments in Language Theory 2004: 261-271 |
| 11 | EE | Igor Potapov:
From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata.
Developments in Language Theory 2004: 345-356 |
| 10 | EE | Alexei Lisitsa,
Igor Potapov:
Membership and Reachability Problems for Row-Monomial Transformations.
MFCS 2004: 623-634 |
| 9 | EE | Leszek Gasieniec,
Igor Potapov,
Qin Xin:
Time Efficient Gossiping in Known Radio Networks.
SIROCCO 2004: 173-184 |
| 8 | EE | Alexei Lisitsa,
Igor Potapov:
Temporal logic with predicate abstraction
CoRR cs.LO/0410072: (2004) |
| 2003 |
|---|
| 7 | EE | Alan Gibbons,
Aris Pagourtzis,
Igor Potapov,
Wojciech Rytter:
Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique.
Comput. J. 46(4): 391-400 (2003) |
| 6 | EE | Leszek Gasieniec,
Igor Potapov:
Time/Space Efficient Compressed Pattern Matching.
Fundam. Inform. 56(1-2): 137-154 (2003) |
| 2002 |
|---|
| 5 | EE | Leszek Gasieniec,
Aris Pagourtzis,
Igor Potapov:
Deterministic Communication in Radio Networks with Large Labels.
ESA 2002: 512-524 |
| 4 | | Leszek Gasieniec,
Igor Potapov:
Gossiping with Unit Messages in Known Radio Networks.
IFIP TCS 2002: 193-205 |
| 3 | EE | Aris Pagourtzis,
Igor Potapov,
Wojciech Rytter:
Observations on Parallel Computation of Transitive and Max-Closure Problems.
PVM/MPI 2002: 217-225 |
| 2001 |
|---|
| 2 | EE | Leszek Gasieniec,
Igor Potapov:
Time/Space Efficient Compressed Pattern Matching.
FCT 2001: 138-149 |
| 1 | EE | Aris Pagourtzis,
Igor Potapov,
Wojciech Rytter:
PVM Computation of the Transitive Closure: The Dependency Graph Approach.
PVM/MPI 2001: 249-256 |
