![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Igor Potapov Igor Grunsky , Oleksiy Kurganskyy , Igor Potapov: On a Maximal NFA Without Mergible States. CSR 2006 : 202-210 Leszek Gasieniec , Roman M. Kolpakov , Igor Potapov, Paul Sant : Real-Time Traversal in Grammar-Based Compressed Files. DCC 2005 : 458 Paul Bell , Igor Potapov: On the Membership of Invertible Diagonal Matrices. Developments in Language Theory 2005 : 146-157 Igor Grunsky , Oleksiy Kurganskyy , Igor Potapov: Languages Representable by Vertex-Labeled Graphs. MFCS 2005 : 435-446 Alexei Lisitsa , Igor Potapov: Temporal Logic with Predicate lambda-Abstraction. TIME 2005 : 147-155 Oleksiy Kurganskyy , Igor Potapov: Computation in One-Dimensional Piecewise Maps and Planar Pseudo-Billiard Systems. UC 2005 : 169-175 Leszek Gasieniec , Roman M. Kolpakov , Igor Potapov: Space efficient search for maximal repetitions. Theor. Comput. Sci. 339 (1): 35-48 (2005) Oleksiy Kurganskyy , Igor Potapov: On the Computation Power of Finite Automata in Two-dimensional Environments. Developments in Language Theory 2004 : 261-271 Igor Potapov: From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata. Developments in Language Theory 2004 : 345-356 Alexei Lisitsa , Igor Potapov: Membership and Reachability Problems for Row-Monomial Transformations. MFCS 2004 : 623-634 Leszek Gasieniec , Igor Potapov, Qin Xin : Time Efficient Gossiping in Known Radio Networks. SIROCCO 2004 : 173-184 Alexei Lisitsa , Igor Potapov: Temporal logic with predicate abstraction CoRR cs.LO/0410072 : (2004) Alan Gibbons , Aris Pagourtzis , Igor Potapov, Wojciech Rytter : Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. Comput. J. 46 (4): 391-400 (2003) Leszek Gasieniec , Igor Potapov: Time/Space Efficient Compressed Pattern Matching. Fundam. Inform. 56 (1-2): 137-154 (2003) Leszek Gasieniec , Aris Pagourtzis , Igor Potapov: Deterministic Communication in Radio Networks with Large Labels. ESA 2002 : 512-524 Leszek Gasieniec , Igor Potapov: Gossiping with Unit Messages in Known Radio Networks. IFIP TCS 2002 : 193-205 Aris Pagourtzis , Igor Potapov, Wojciech Rytter : Observations on Parallel Computation of Transitive and Max-Closure Problems. PVM/MPI 2002 : 217-225 Leszek Gasieniec , Igor Potapov: Time/Space Efficient Compressed Pattern Matching. FCT 2001 : 138-149 Aris Pagourtzis , Igor Potapov, Wojciech Rytter : PVM Computation of the Transitive Closure: The Dependency Graph Approach. PVM/MPI 2001 : 249-256 1 [ 17 ] 2 [ 2 ] [ 4 ] [ 5 ] [ 6 ] [ 9 ] [ 13 ] [ 18 ] 3 [ 7 ] 4 [ 16 ] [ 19 ] 5 [ 13 ] [ 18 ] 6 [ 12 ] [ 14 ] [ 16 ] [ 19 ] 7 [ 8 ] [ 10 ] [ 15 ] 8 [ 1 ] [ 3 ] [ 5 ] [ 7 ] 9 [ 1 ] [ 3 ] [ 7 ] 10 [ 18 ] 11 [ 9 ] ![]() ©2006 Association for Computing Machinery |