![]() | ![]() |
Lila Santean
List of publications from the DBLP Bibliography Server - FAQ
| 2012 | ||
|---|---|---|
| 137 | Lila Kari, Shinnosuke Seki, Zhi Xu: Triangular and Hexagonal Tile Self-assembly Systems. Computation, Physics and Beyond 2012: 357-375 | |
| 136 | Lila Kari, Steffen Kopecki, Shinnosuke Seki: Iterated Hairpin Completions of Non-crossing Words. SOFSEM 2012: 337-348 | |
| 135 | Ehsan Chiniforooshan, Lila Kari, Zhi Xu: Pseudopower Avoidance. Fundam. Inform. 114(1): 55-72 (2012) | |
| 134 | Bo Cui, Yuan Gao, Lila Kari, Sheng Yu: State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal. Int. J. Found. Comput. Sci. 23(1): 51-66 (2012) | |
| 2011 | ||
| 133 | Lila Kari, Zhi Xu: De Bruijn Sequences Revisited. AFL 2011: 241-254 | |
| 132 | Nathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki: The Power of Nondeterminism in Self-Assembly. SODA 2011: 590-602 | |
| 131 | Ehsan Chiniforooshan, Mark Daley, Oscar H. Ibarra, Lila Kari, Shinnosuke Seki: One-Reversal Counter Machines and Multihead Automata: Revisited. SOFSEM 2011: 166-177 | |
| 130 | Lila Kari, Steffen Kopecki, Shinnosuke Seki: On the regularity of iterated hairpin completion of a single word CoRR abs/1104.2385: (2011) | |
| 129 | Lila Kari, Steffen Kopecki, Shinnosuke Seki: Iterated Hairpin Completions of Non-crossing Words CoRR abs/1110.0760: (2011) | |
| 128 | Lila Kari, Steffen Kopecki: Deciding if a Regular Language is Generated by a Splicing System CoRR abs/1112.4897: (2011) | |
| 127 | Maxime Crochemore, Lila Kari, Mehryar Mohri, Dirk Nowotka: Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081). Dagstuhl Reports 1(2): 47-66 (2011) | |
| 126 | Bo Cui, Lila Kari, Shinnosuke Seki: K-Comma Codes and Their Generalizations. Fundam. Inform. 107(1): 1-18 (2011) | |
| 125 | Lila Kari, Shinnosuke Seki, Steffen Kopecki: On the Regularity of Iterated Hairpin Completion of a Single Word. Fundam. Inform. 110(1-4): 201-215 (2011) | |
| 124 | Elena Czeizler, Eugen Czeizler, Lila Kari, Shinnosuke Seki: An extension of the Lyndon-Schützenberger result to pseudoperiodic words. Inf. Comput. 209(4): 717-730 (2011) | |
| 123 | Mark Daley, Lila Kari, Shinnosuke Seki, Petr Sosík: Orthogonal Shuffle on Trajectories. Int. J. Found. Comput. Sci. 22(1): 213-222 (2011) | |
| 122 | Lila Kari, Benoît Masson, Shinnosuke Seki: Properties of Pseudo-Primitive Words and their Applications. Int. J. Found. Comput. Sci. 22(2): 447-471 (2011) | |
| 121 | Lila Kari, Shinnosuke Seki: Schema for Parallel Insertion and Deletion: Revisited. Int. J. Found. Comput. Sci. 22(7): 1655-1668 (2011) | |
| 120 | Bo Cui, Yuan Gao, Lila Kari, Sheng Yu: State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection. Int. J. Found. Comput. Sci. 22(8): 1797-1812 (2011) | |
| 119 | Eugen Czeizler, Lila Kari: Towards a neighborhood simplification of tile systems: From Moore to quasi-linear dependencies. Natural Computing 10(1): 103-117 (2011) | |
| 118 | Lila Kari, Benoît Masson: Polyominoes simulating arbitrary-neighborhood zippers and tilings. Theor. Comput. Sci. 412(43): 6083-6100 (2011) | |
| 117 | Bo Cui, Lila Kari, Shinnosuke Seki: Block insertion and deletion on trajectories. Theor. Comput. Sci. 412(8-10): 714-728 (2011) | |
| 2010 | ||
| 116 | Bo Cui, Yuan Gao, Lila Kari, Sheng Yu: State Complexity of Catenation Combined with Union and Intersection. CIAA 2010: 95-104 | |
| 115 | Lila Kari, Afroza Rahman: Ciliate Gene Unscrambling with Fewer Templates DCFS 2010: 120-129 | |
| 114 | Bo Cui, Yuan Gao, Lila Kari, Sheng Yu: State Complexity of Catenation Combined with Star and Reversal DCFS 2010: 58-67 | |
| 113 | Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki: Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits Using DNA Strand Displacement. DNA 2010: 25-36 | |
| 112 | David Doty, Lila Kari, Benoît Masson: Negative Interactions in Irreversible Self-assembly. DNA 2010: 37-48 | |
| 111 | Lila Kari, Shinnosuke Seki, Zhi Xu: Triangular Tile Self-assembly Systems. DNA 2010: 89-99 | |
| 110 | Lila Kari, Shinnosuke Seki: Schema for Parallel Insertion and Deletion. Developments in Language Theory 2010: 267-278 | |
| 109 | Lila Kari: DNA Computing and Its Implications for Theoretical Computer Science. Developments in Language Theory 2010: 32 | |
| 108 | Ehsan Chiniforooshan, Lila Kari, Zhi Xu: Pseudo-power Avoidance. Developments in Language Theory 2010: 432-433 | |
| 107 | David Doty, Lila Kari, Benoît Masson: Negative Interactions in Irreversible Self-Assembly CoRR abs/1002.2746: (2010) | |
| 106 | Lila Kari, Benoît Masson: Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings CoRR abs/1002.3769: (2010) | |
| 105 | Lila Kari, Benoît Masson, Shinnosuke Seki: Properties of Pseudo-Primitive Words and their Applications CoRR abs/1002.4084: (2010) | |
| 104 | Lila Kari, Shinnosuke Seki, Zhi Xu: Triangular Self-Assembly CoRR abs/1002.4996: (2010) | |
| 103 | Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki: Scalable, Time-Responsive, Digital, Energy-Efficient Molecular Circuits using DNA Strand Displacement CoRR abs/1003.3275: (2010) | |
| 102 | Nathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki: The Power of Nondeterminism in Self-Assembly CoRR abs/1006.2897: (2010) | |
| 101 | Bo Cui, Yuan Gao, Lila Kari, Sheng Yu: State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation CoRR abs/1006.4646: (2010) | |
| 100 | Nathaniel Bryans, Ehsan Chiniforooshan, David Doty, Lila Kari, Shinnosuke Seki: The Power of Nondeterminism in Self-Assembly. Electronic Colloquium on Computational Complexity (ECCC) 17: 131 (2010) | |
| 99 | Lila Kari, Shinnosuke Seki: An Improved Bound for an Extension of Fine and Wilf's Theorem and Its Optimality. Fundam. Inform. 101(3): 215-236 (2010) | |
| 98 | Lila Kari, Kalpana Mahalingam: Watson-Crick palindromes in DNA computing. Natural Computing 9(2): 297-316 (2010) | |
| 97 | Elena Czeizler, Lila Kari, Shinnosuke Seki: On a special class of primitive words. Theor. Comput. Sci. 411(3): 617-630 (2010) | |
| 2009 | ||
| 96 | Bo Cui, Lila Kari, Shinnosuke Seki: On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes. CAI 2009: 204-219 | |
| 95 | Elena Czeizler, Eugen Czeizler, Lila Kari, Shinnosuke Seki: An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words. Developments in Language Theory 2009: 183-194 | |
| 94 | Ehsan Chiniforooshan, Lila Kari, Zhi Xu: Pseudo-Power Avoidance CoRR abs/0911.2233: (2009) | |
| 93 | Lila Kari, Shinnosuke Seki: On pseudoknot-bordered words and their properties. J. Comput. Syst. Sci. 75(2): 113-121 (2009) | |
| 92 | 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) | |
| 91 | Lila Kari, Kalpana Mahalingam, Shinnosuke Seki: Twin-roots of words and their properties. Theor. Comput. Sci. 410(24-25): 2393-2400 (2009) | |
| 90 | Elena Czeizler, Eugen Czeizler, Lila Kari, Kai Salomaa: On the descriptional complexity of Watson-Crick automata. Theor. Comput. Sci. 410(35): 3250-3260 (2009) | |
| 2008 | ||
| 89 | Elena Czeizler, Eugen Czeizler, Lila Kari, Kai Salomaa: Watson-Crick automata: determinism and state complexity. DCFS 2008: 121-133 | |
| 88 | Masami Ito, Lila Kari, Zachary Kincaid, Shinnosuke Seki: Duplication in DNA Sequences. Developments in Language Theory 2008: 419-430 | |
| 87 | Elena Czeizler, Lila Kari, Shinnosuke Seki: On a Special Class of Primitive Words. MFCS 2008: 265-277 | |
| 86 | Lila Kari, Grzegorz Rozenberg: The many facets of natural computing. Commun. ACM 51(10): 72-83 (2008) | |
| 85 | Natasa Jonoska, Lila Kari, Kalpana Mahalingam: Involution Solid and Join codes. Fundam. Inform. 86(1-2): 127-142 (2008) | |
| 84 | Lila Kari, Kalpana Mahalingam: Watson-Crick Bordered Words and their Syntactic Monoid. Int. J. Found. Comput. Sci. 19(5): 1163-1179 (2008) | |
| 83 | Lila Kari, Petr Sosík: On the weight of universal insertion grammars. Theor. Comput. Sci. 396(1-3): 264-270 (2008) | |
| 2007 | ||
| 82 | Lila Kari, Kalpana Mahalingam: Watson-Crick Conjugate and Commutative Words. DNA 2007: 273-283 | |
| 81 | Lila Kari: Nanocomputing by Self-assembly. UC 2007: 27 | |
| 80 | Lila Kari, Kalpana Mahalingam, Gabriel Thierrin: The syntactic monoid of hairpin-free languages. Acta Inf. 44(3-4): 153-166 (2007) | |
| 79 | Lila Kari, Kalpana Mahalingam: Involutively Bordered Words. Int. J. Found. Comput. Sci. 18(5): 1089-1106 (2007) | |
| 2006 | ||
| 78 | Lila Kari, Kalpana Mahalingam: DNA Codes and Their Properties. DNA 2006: 127-142 | |
| 77 | Natasa Jonoska, Lila Kari, Kalpana Mahalingam: Involution Solid and Join Codes. Developments in Language Theory 2006: 192-202 | |
| 76 | Lila Kari, Kalpana Mahalingam: Involution Solid Codes. Nanotechnology: Science and Computation 2006: 137-146 | |
| 75 | Lila Kari, Elena Losseva, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin: A Formal Language Analysis of DNA Hairpin Structures. Fundam. Inform. 71(4): 453-475 (2006) | |
| 74 | Lila Kari, Elena Losseva: Block Substitutions and Their Properties. Fundam. Inform. 73(1-2): 165-178 (2006) | |
| 2005 | ||
| 73 | Lila Kari, Petr Sosík: On Weight of Universal Insertion Grammars. DCFS 2005: 206-214 | |
| 72 | Lila Kari, Stavros Konstantinidis, Elena Losseva, Petr Sosík, Gabriel Thierrin: Hairpin Structures in DNA Words. DNA 2005: 158-170 | |
| 71 | Lila Kari, Stavros Konstantinidis, Petr Sosík, Gabriel Thierrin: On Hairpin-Free Words and Languages. Developments in Language Theory 2005: 296-307 | |
| 70 | Halina Kaminski, Lila Kari, Mark Perry: Who Counts Your Votes? EEE 2005: 598-603 | |
| 69 | Cezar Câmpeanu, Lila Kari, Andrei Paun: Results on Transforming NFA into DFCA. Fundam. Inform. 64(1-4): 53-63 (2005) | |
| 68 | Lila Kari, Stavros Konstantinidis, Petr Sosík: Operations on trajectories with applications to coding and bioinformatics. Int. J. Found. Comput. Sci. 16(3): 531-546 (2005) | |
| 67 | Lila Kari, Stavros Konstantinidis, Petr Sosík: Bond-free languages: formalizations, maximality and construction methods. Int. J. Found. Comput. Sci. 16(5): 1039-1070 (2005) | |
| 66 | Lila Kari, Stavros Konstantinidis: Language equations, maximality and error-detection. J. Comput. Syst. Sci. 70(1): 157-178 (2005) | |
| 65 | Rudolf Freund, Lila Kari, Marion Oswald, Petr Sosík: Computationally universal P systems without priorities: two catalysts are sufficient. Theor. Comput. Sci. 330(2): 251-266 (2005) | |
| 64 | Lila Kari, Petr Sosík: Aspects of shuffle and deletion on trajectories. Theor. Comput. Sci. 332(1-3): 47-61 (2005) | |
| 63 | Lila Kari, Stavros Konstantinidis, Petr Sosík: On properties of bond-free DNA languages. Theor. Comput. Sci. 334(1-3): 131-159 (2005) | |
| 2004 | ||
| 62 | Lila Kari, Carlos Martín-Vide, Andrei Paun: On the Universality of P Systems with Minimal Symport/Antiport Rules. Aspects of Molecular Computing 2004: 254-265 | |
| 61 | Lila Kari, Stavros Konstantinidis, Petr Sosík: Substitutions, Trajectories and Noisy Channels. CIAA 2004: 202-212 | |
| 60 | Lila Kari, Stavros Konstantinidis, Petr Sosík: Bond-Free Languages: Formalizations, Maximality and Construction Methods. DNA 2004: 169-181 | |
| 59 | Lila Kari, Stavros Konstantinidis, Petr Sosík: Preventing Undesirable Bonds Between DNA Codewords. DNA 2004: 182-191 | |
| 58 | Lila Kari, Stavros Konstantinidis, Petr Sosík: Substitution on Trajectories. Theory Is Forever 2004: 145-158 | |
| 57 | Lila Kari, Petr Sosík: On Language Equations with Deletion. Bulletin of the EATCS 83: 173-180 (2004) | |
| 56 | Lila Kari, Stavros Konstantinidis: Descriptional Complexity of Error/Edit Systems. Journal of Automata, Languages and Combinatorics 9(2/3): 293-309 (2004) | |
| 2003 | ||
| 55 | Lila Kari, Stavros Konstantinidis, Elena Losseva, Geoff Wozniak: Sticky-free and overhang-free DNA languages. Acta Inf. 40(2): 119-157 (2003) | |
| 54 | Mark Daley, Oscar H. Ibarra, Lila Kari, Ian McQuillan, Koji Nakano: The ld and dlad Bio-Operations on Formal Languages. Journal of Automata, Languages and Combinatorics 8(3): 477-498 (2003) | |
| 53 | Salah Hussini, Lila Kari, Stavros Konstantinidis: Coding properties of DNA languages. Theor. Comput. Sci. 290(3): 1557-1579 (2003) | |
| 52 | Mark Daley, Oscar H. Ibarra, Lila Kari: Closure and decidability properties of some language classes with respect to ciliate bio-operations. Theor. Comput. Sci. 306(1-3): 19-38 (2003) | |
| 2002 | ||
| 51 | Lila Kari, Stavros Konstantinidis: Descriptional Complexity of Error/Edit Systems. DCFS 2002: 133-147 | |
| 50 | Mark Daley, Lila Kari: Some Properties of Ciliate Bio-operations. Developments in Language Theory 2002: 116-127 | |
| 49 | Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus: On the Decidability of Self-Assembly of Infinite Ribbons. FOCS 2002: 530-537 | |
| 48 | Lila Kari, Rob Kitto, Gabriel Thierrin: Codes, Involutions, and DNA Encodings. Formal and Natural Computing 2002: 376-393 | |
| 2001 | ||
| 47 | Salah Hussini, Lila Kari, Stavros Konstantinidis: Coding Properties of DNA Languages. DNA 2001: 57-69 | |
| 46 | Jarkko Kari, Lila Kari: Context-free recombinations. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 361-375 | |
| 45 | Lila Kari, Andrei Paun: String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation. Words, Semigroups, and Transductions 2001: 275-287 | |
| 44 | Lila Kari: DNA Computers: Tomorrow's Reality. Current Trends in Theoretical Computer Science 2001: 811-829 | |
| 43 | Lila Kari: DNA computing in vitro and in vivo. Future Generation Comp. Syst. 17(7): 823-834 (2001) | |
| 42 | Lila Kari, Rob Kitto, Greg Gloor: A computer scientist's guide to molecular biology. Soft Comput. 5(2): 95-101 (2001) | |
| 2000 | ||
| 41 | Lila Kari: Half century of automata theory. SIGACT News 31(4): 121-124 (2000) | |
| 40 | Lila Kari, Greg Gloor, Sheng Yu: Using DNA to solve the Bounded Post Correspondence Problem. Theor. Comput. Sci. 231(2): 193-203 (2000) | |
| 39 | Masami Ito, Lila Kari, Gabriel Thierrin: Shuffle and scattered deletion closure of languages. Theor. Comput. Sci. 245(1): 115-133 (2000) | |
| 1999 | ||
| 38 | Lila Kari, Mark Daley, Greg Gloor, Rani Siromoney, Laura F. Landweber: How to Compute with DNA. FSTTCS 1999: 269-282 | |
| 37 | Lila Kari, Hanan Lutfiyya, Carlos Martín-Vide, Gheorghe Paun: Bringing PC Grammar Systems Closer to Hoare's CSPs. Grammatical Models of Multi-Agent Systems 1999: 64-85 | |
| 36 | Lila Kari, Jarkko Kari, Laura F. Landweber: Reversible Molecular Computation in Ciliates. Jewels are Forever 1999: 353-363 | |
| 35 | Mark Daley, Lila Kari, Greg Gloor, Rani Siromoney: Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation. SPIRE/CRIWG 1999: 47-54 | |
| 34 | Greg Gloor, Lila Kari, Michelle Gaasenbeek, Sheng Yu: Towards a DNA Solution to the Shortest Common Superstring Problem. International Journal on Artificial Intelligence Tools 8(4): 385-400 (1999) | |
| 33 | Rudolf Freund, Lila Kari, Gheorghe Paun: DNA Computing Based on Splicing: The Existence of Universal Computers. Theory Comput. Syst. 32(1): 69-112 (1999) | |
| 1998 | ||
| 32 | Lila Kari, Greg Gloor, Sheng Yu: Using DNA to solve the Bounded Post Correspondence Problem. MCU (1) 1998: 51-65 | |
| 31 | Lila Kari, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu: DNA Computing, Sticker Systems, and Universality. Acta Inf. 35(5): 401-420 (1998) | |
| 1997 | ||
| 30 | Lila Kari: From Micro-Soft to Bio-Soft: Computing With DNA. BCEC 1997: 146-164 | |
| 29 | Masami Ito, Lila Kari, Gabriel Thierrin: Insertion and Deletion Closure of Languages. Theor. Comput. Sci. 183(1): 3-19 (1997) | |
| 1996 | ||
| 28 | Erzsébet Csuhaj-Varjú, Lila Kari, Gheorghe Paun: Test Tube Distributed Systems Based on Splicing. Computers and Artificial Intelligence 15(2-3): (1996) | |
| 27 | Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská: Two Lower Bounds on Distributive Generation of Languages. Fundam. Inform. 25(3): 271-284 (1996) | |
| 26 | Lila Kari, Gabriel Thierrin: Contextual Insertions/Deletions and Computability. Inf. Comput. 131(1): 47-61 (1996) | |
| 25 | Lila Kari, Gabriel Thierrin: Maximal and Minimal Solutions to Language Equations. J. Comput. Syst. Sci. 53(3): 487-496 (1996) | |
| 24 | Lila Kari, Gheorghe Paun, Arto Salomaa: The Power of Restricted Splicing with Rules from a Regular Language. J. UCS 2(4): 224-240 (1996) | |
| 23 | Lila Kari, Gabriel Thierrin: Omega-Syntactic Congruences. Journal of Automata, Languages and Combinatorics 1(1): 13-26 (1996) | |
| 1995 | ||
| 22 | Lila Kari, Gabriel Thierrin: Morphisms and Associated Congruences. Developments in Language Theory 1995: 119-128 | |
| 21 | Lila Kari, Grzegorz Rozenberg, Arto Salomaa: Generalised DOL Trees. Acta Cybern. 12(1): 1-10 (1995) | |
| 20 | Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa: On Parallel Deletions Applied to a Word. ITA 29(2): 129-144 (1995) | |
| 19 | Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa: Teams in cooperating grammar systems. J. Exp. Theor. Artif. Intell. 7(4): 347-359 (1995) | |
| 18 | Lila Kari, Alexandru Mateescu, Gheorghe Paun, Arto Salomaa: Multi-Pattern Languages. Theor. Comput. Sci. 141(1&2): 253-268 (1995) | |
| 1994 | ||
| 17 | Juraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská: Two Lower Bounds on Distributive Generation of Languages. MFCS 1994: 423-432 | |
| 16 | Lila Kari: Power of Controlled Insertion and Deletion. Results and Trends in Theoretical Computer Science 1994: 197-212 | |
| 15 | Przemyslaw Prusinkiewicz, Lila Kari: Subapical Bracketed L-Systems. TAGT 1994: 550-564 | |
| 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 | Lila Kari: On Language Equations with Invertible Operations. Theor. Comput. Sci. 132(2): 129-150 (1994) | |
| 1993 | ||
| 12 | Juraj Hromkovic, Jarkko Kari, Lila Kari: Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems. MFCS 1993: 495-505 | |
| 11 | Lila Kari: Insertion operations: Closure properties. Bulletin of the EATCS 51: 181-191 (1993) | |
| 10 | Lila Kari: Generalized Derivatives. Fundam. Inform. 18: 27-39 (1993) | |
| 9 | Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun: Deletion Sets. Fundam. Inform. 19(3/4): 355-370 (1993) | |
| 8 | Lila Kari, Alexandru Mateescu, Arto Salomaa, Gheorghe Paun: Gramars with Oracles. Sci. Ann. Cuza Univ. 2: 3-12 (1993) | |
| 1992 | ||
| 7 | Lila Kari: Insertion and Deletion of Words: Determinism and Reversibility. MFCS 1992: 315-326 | |
| 6 | Lila Kari, Solomon Marcus, Gheorghe Paun, Arto Salomaa: In the prehistory of formal language theory: Gauss Languages. Bulletin of the EATCS 46: 124-139 (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) | |
| 1991 | ||
| 4 | Hannu Nurmi, Arto Salomaa, Lila Santean: Secret ballot elections in computer networks. Computers & Security 10(6): 553-560 (1991) | |
| 1990 | ||
| 3 | Lila Santean: A Hierarchy of Unary Primitive Recursive String-Functions. IMYCS 1990: 225-233 | |
| 2 | Lila Santean: Parallel Communicating Systems. Bulletin of the EATCS 42: 160-171 (1990) | |
| 1 | Arto Salomaa, Lila Santean: Secret Selling of Secrets with Several Buyers. Bulletin of the EATCS 42: 178-186 (1990) | |
Colors in the list of coauthors
Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page