| 2009 |
| 72 | EE | Leonard M. Adleman,
Jarkko Kari,
Lila Kari,
Dustin Reishus,
Petr Sosík:
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly.
SIAM J. Comput. 38(6): 2356-2381 (2009) |
| 71 | EE | Natasa Jonoska,
Jarkko Kari:
Preface.
Theor. Comput. Sci. 410(15): 1415-1416 (2009) |
| 70 | EE | Natasa Jonoska,
Jarkko Kari:
Preface.
Theor. Comput. Sci. 410(16): 1475-1476 (2009) |
| 2008 |
| 69 | EE | Enrico Formenti,
Jarkko Kari,
Siamak Taati:
The Most General Conservation Law for a Cellular Automaton.
CSR 2008: 194-203 |
| 68 | | Jarkko Kari:
Undecidable properties on the dynamics of reversible one-dimensional cellular automata.
JAC 2008: 3-14 |
| 67 | | Jarkko Kari,
Siamak Taati:
A particle displacement representation for conservation laws in two-dimensional cellular automata.
JAC 2008: 65-73 |
| 66 | EE | Jarkko Kari,
Nicolas Ollinger:
Periodicity and Immortality in Reversible Computing.
MFCS 2008: 419-430 |
| 65 | EE | Jarkko Kari:
On the Undecidability of the Tiling Problem.
SOFSEM 2008: 74-82 |
| 64 | EE | Jarkko Kari:
Data Compression Codes, Lossy.
Wiley Encyclopedia of Computer Science and Engineering 2008 |
| 63 | EE | Marie-Pierre Béal,
Eugen Czeizler,
Jarkko Kari,
Dominique Perrin:
Unambiguous Automata.
Mathematics in Computer Science 1(4): 625-638 (2008) |
| 2007 |
| 62 | EE | Jarkko Kari:
The Tiling Problem Revisited (Extended Abstract).
MCU 2007: 72-79 |
| 61 | EE | Jarkko Kari,
Jenna Hartel:
Information and higher things in life: Addressing the pleasurable and the profound in information science.
JASIST 58(8): 1131-1147 (2007) |
| 60 | EE | Eugen Czeizler,
Jarkko Kari:
A tight linear bound on the synchronization delay of bijective automata.
Theor. Comput. Sci. 380(1-2): 23-36 (2007) |
| 2006 |
| 59 | EE | Jarkko Kari:
Image Processing Using Finite Automata.
Recent Advances in Formal Languages and Applications 2006: 171-208 |
| 58 | EE | Jarkko Kari:
Evolutionary information seeking: A case study of personal development and Internet searching.
First Monday 11(1): (2006) |
| 57 | EE | Manfred Droste,
Jarkko Kari,
Paula Steinby:
Observations on the Smoothness Properties of Real Functions Computed by Weighted Finite Automata.
Fundam. Inform. 73(1-2): 99-106 (2006) |
| 56 | EE | Reijo Savolainen,
Jarkko Kari:
Facing and bridging gaps in Web searching.
Inf. Process. Manage. 42(2): 519-537 (2006) |
| 55 | EE | Jarkko Kari:
Free-form searching via web sites: Content and moving observed in the context of personal development.
Inf. Process. Manage. 42(3): 769-784 (2006) |
| 2005 |
| 54 | EE | Jarkko Kari:
Reversible Cellular Automata.
Developments in Language Theory 2005: 57-68 |
| 53 | EE | Eugen Czeizler,
Jarkko Kari:
A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata.
ICALP 2005: 410-420 |
| 52 | EE | Jarkko Kari:
Theory of cellular automata: A survey.
Theor. Comput. Sci. 334(1-3): 3-33 (2005) |
| 51 | EE | Vincent Bernardi,
Bruno Durand,
Enrico Formenti,
Jarkko Kari:
A new dimension sensitive property for cellular automata.
Theor. Comput. Sci. 345(2-3): 235-247 (2005) |
| 2004 |
| 50 | EE | Vincent Bernardi,
Bruno Durand,
Enrico Formenti,
Jarkko Kari:
A New Dimension Sensitive Property for Cellular Automata.
MFCS 2004: 416-426 |
| 49 | EE | Jarkko Kari,
Cristopher Moore:
Rectangles and Squares Recognized by Two-Dimensional Automata.
Theory Is Forever 2004: 134-144 |
| 48 | EE | Jarkko Kari:
Web information seeking by pages: an observational study of moving and stopping.
Inf. Res. 9(4): (2004) |
| 47 | EE | Jarkko Kari:
Preface.
Theor. Comput. Sci. 325(2): 169- (2004) |
| 2003 |
| 46 | EE | Jarkko Kari:
Synchronizing finite automata on Eulerian digraphs.
Theor. Comput. Sci. 295: 223-232 (2003) |
| 2002 |
| 45 | EE | Jarkko Kari:
Infinite Snake Tiling Problems.
Developments in Language Theory 2002: 67-77 |
| 44 | EE | Leonard M. Adleman,
Jarkko Kari,
Lila Kari,
Dustin Reishus:
On the Decidability of Self-Assembly of Infinite Ribbons.
FOCS 2002: 530-537 |
| 43 | | Li Hong,
Roberto Sannino,
Jarkko Kari:
Multistage block-matching motion estimation for superresolution video reconstruction.
VCIP 2002: 1052-1060 |
| 42 | EE | Karel Culik II,
Juhani Karhumäki,
Jarkko Kari:
A Note on Synchronized Automata and Road Coloring Problem.
Int. J. Found. Comput. Sci. 13(3): 459-471 (2002) |
| 41 | EE | Jarkko Kari:
Synchronization and Stability of Finite Automata.
J. UCS 8(2): 270-277 (2002) |
| 2001 |
| 40 | EE | Karel Culik II,
Juhani Karhumäki,
Jarkko Kari:
A Note on Synchronized Automata and Road Coloring Problem.
Developments in Language Theory 2001: 175-185 |
| 39 | EE | Jarkko Kari:
Synchronizing Finite Automata on Eulerian Digraphs.
MFCS 2001: 432-438 |
| 38 | EE | Jarkko Kari,
Cristopher Moore:
New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata.
STACS 2001: 396-406 |
| 37 | | Jarkko Kari:
A Counter Example to a Conjecture Concerning Synchronizing Words in Finite Automata.
Bulletin of the EATCS 73: 146 (2001) |
| 2000 |
| 36 | EE | Jarkko Kari:
Linear Cellular Automata with Multiple State Variables.
STACS 2000: 110-121 |
| 1999 |
| 35 | | Lila Kari,
Jarkko Kari,
Laura F. Landweber:
Reversible Molecular Computation in Ciliates.
Jewels are Forever 1999: 353-363 |
| 34 | | Jarkko Kari:
On the Circuit Depth of Structurally Reversible Cellular Automata.
Fundam. Inform. 38(1-2): 93-107 (1999) |
| 1998 |
| 33 | EE | Jarkko Kari,
Mihai Gavrilescu:
Intensity Controlled Motion Compensation.
Data Compression Conference 1998: 249-258 |
| 1997 |
| 32 | EE | Karel Culik II,
Jarkko Kari:
On Aperiodic Sets of Wang Tiles.
Foundations of Computer Science: Potential - Theory - Cognition 1997: 153-162 |
| 31 | | Karel Culik II,
Jarkko Kari:
Computational Fractal Geometry with WFA.
Acta Inf. 34(2): 151-166 (1997) |
| 30 | EE | Karel Culik II,
Vladimir Valenta,
Jarkko Kari:
Compression of Silhouette-like Images based on WFA.
J. UCS 3(10): 1100-1113 (1997) |
| 1996 |
| 29 | | Karel Culik II,
Jarkko Kari:
An Aperiodic Set of Wang Cubes.
STACS 1996: 137-146 |
| 28 | EE | Karel Culik II,
Jarkko Kari:
Finite state transformation of images.
Computers & Graphics 20(1): 125-135 (1996) |
| 27 | EE | Jarkko Kari:
A small aperiodic set of Wang tiles.
Discrete Mathematics 160(1-3): 259-264 (1996) |
| 26 | | Juraj Hromkovic,
Jarkko Kari,
Lila Kari,
Dana Pardubská:
Two Lower Bounds on Distributive Generation of Languages.
Fundam. Inform. 25(3): 271-284 (1996) |
| 25 | | Jarkko Kari:
Representation of Reversible Cellular Automata with Block Permutations.
Mathematical Systems Theory 29(1): 47-61 (1996) |
| 1995 |
| 24 | | Karel Culik II,
Jarkko Kari:
Finite State Methods for Compression and Manipulation of Images.
Data Compression Conference 1995: 142-151 |
| 23 | | Jarkko Kari,
Valtteri Niemi:
Colored Gauss and Tangent Codes on the Torus.
Developments in Language Theory 1995: 54-63 |
| 22 | | Karel Culik II,
Jarkko Kari:
Finite State Transformations of Images.
ICALP 1995: 51-62 |
| 21 | EE | Karel Culik II,
Jarkko Kari:
An Aperiodic Set of Wang Cubes.
J. UCS 1(10): 675-686 (1995) |
| 1994 |
| 20 | | Juraj Hromkovic,
Jarkko Kari,
Lila Kari,
Dana Pardubská:
Two Lower Bounds on Distributive Generation of Languages.
MFCS 1994: 423-432 |
| 19 | | Karel Culik II,
Jarkko Kari:
Parallel Pattern Generation with One-Way Communications.
Results and Trends in Theoretical Computer Science 1994: 85-96 |
| 18 | | Karel Culik II,
Jarkko Kari:
On the Power of L-Systems in Image Generation.
Acta Inf. 31(8): 761-773 (1994) |
| 17 | | Jarkko Kari,
Pasi Fränti:
Arithmetic Coding of Weighted Finite Automata.
ITA 28(3-4): 343-360 (1994) |
| 16 | | Karel Culik II,
Jarkko Kari:
Image-Data Compression Using Edge-Optimizing Algorithm for WFA Inference.
Inf. Process. Manage. 30(6): 829-838 (1994) |
| 15 | | Jarkko Kari:
Reversibility and Surjectivity Problems of Cellular Automata.
J. Comput. Syst. Sci. 48(1): 149-182 (1994) |
| 14 | | Juraj Hromkovic,
Jarkko Kari,
Lila Kari:
Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems.
Theor. Comput. Sci. 127(1): 123-147 (1994) |
| 13 | | Jarkko Kari:
Rice's Theorem for the Limit Sets of Cellular Automata.
Theor. Comput. Sci. 127(2): 229-254 (1994) |
| 1993 |
| 12 | | Jarkko Kari,
Valtteri Niemi:
Morphic Images of Gauss Codes.
Developments in Language Theory 1993: 144-156 |
| 11 | | Karel Culik II,
Jarkko Kari:
On the Power of L-Systems in Image Generation.
Developments in Language Theory 1993: 225-236 |
| 10 | | Karel Culik II,
Jarkko Kari:
Image Compression Using Weighted Finite Automata.
MFCS 1993: 392-402 |
| 9 | | Juraj Hromkovic,
Jarkko Kari,
Lila Kari:
Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems.
MFCS 1993: 495-505 |
| 8 | EE | Karel Culik II,
Jarkko Kari:
Image compression using weighted finite automata.
Computers & Graphics 17(3): 305-313 (1993) |
| 7 | | Karel Culik II,
Jarkko Kari:
Parametrized Recurrent Systems for Image Generation.
Inf. Process. Lett. 48(6): 267-274 (1993) |
| 1992 |
| 6 | | Jarkko Kari:
The Nilpotency Problem of One-Dimensional Cellular Automata.
SIAM J. Comput. 21(3): 571-586 (1992) |
| 5 | | Lila Santean,
Jarkko Kari:
The Impact of the Number of Cooperating Grammars on the Generative Power.
Theor. Comput. Sci. 98(2): 249-262 (1992) |
| 1990 |
| 4 | | Jarkko Kari:
Games played on the plane: Solitaire and Cellular Automata.
Bulletin of the EATCS 40: 195-200 (1990) |
| 1989 |
| 3 | | Jarkko Kari:
Observations Concerning a Public-Key Cryptosystem Based on Iterated Morphisms.
Theor. Comput. Sci. 66(1): 45-53 (1989) |
| 1988 |
| 2 | | Jarkko Kari:
A Cryptosystem Based on Propositional Logic.
IMYCS 1988: 210-219 |
| 1 | EE | Jarkko Kari:
A cryptanalytic observation concerning systems based on language theory.
Discrete Applied Mathematics 21(3): 265-268 (1988) |