Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Kai Salomaa
2010 – today
- 2012
[j86]Arto Salomaa, Kai Salomaa, Andrew L. Szilard: Sheng Yu (1950-2012) In Memoriam. Fundam. Inform. 120(1): 71-74 (2012)
[j85]Cristian S. Calude, Kai Salomaa, Tania Roblot: State-Size Hierarchy for Finite-State Complexity. Int. J. Found. Comput. Sci. 23(1): 37-50 (2012)
[j84]Salimur Choudhury, Kai Salomaa, Selim G. Akl: A Cellular Automaton Model for Wireless Sensor Networks. J. Cellular Automata 7(3): 223-241 (2012)
[j83]David Sears, Kai Salomaa: Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes. Natural Computing 11(4): 653-664 (2012)
[j82]Xiaoxue Piao, Kai Salomaa: State complexity of the concatenation of regular tree languages. Theor. Comput. Sci. 429: 273-281 (2012)
[j81]Xiaoxue Piao, Kai Salomaa: Lower bounds for the size of deterministic unranked tree automata. Theor. Comput. Sci. 454: 231-239 (2012)
[c71]Alexander Okhotin, Xiaoxue Piao, Kai Salomaa: Descriptional Complexity of Input-Driven Pushdown Automata. Languages Alive 2012: 186-206
[c70]Xiaoxue Piao, Kai Salomaa: State Complexity of Kleene-Star Operations on Trees. Computation, Physics and Beyond 2012: 388-402
[c69]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl: State Complexity and Limited Nondeterminism. DCFS 2012: 252-265
[c68]Xiaoxue Piao, Kai Salomaa: State Complexity of Projection and Quotient on Unranked Trees. DCFS 2012: 280-293
[c67]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa: Computing the Edit-Distance between a Regular Language and a Context-Free Language. Developments in Language Theory 2012: 85-96
[c66]Salimur Choudhury, Kai Salomaa, Selim G. Akl: A cellular automaton model for connectivity preserving deployment of mobile wireless sensors. ICC 2012: 6545-6549
[c65]Salimur Choudhury, Kai Salomaa, Selim G. Akl: Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks. TPNC 2012: 108-120
[c64]Salimur Choudhury, Selim G. Akl, Kai Salomaa: Energy efficient cellular automaton based algorithms for mobile wireless sensor networks. WCNC 2012: 2341-2346
[c63]- 2011
[j80]Xiaoxue Piao, Kai Salomaa: Transformations Between Different Models of Unranked Bottom-Up Tree Automata. Fundam. Inform. 109(4): 405-424 (2011)
[j79]Yuan Gao, Kai Salomaa, Sheng Yu: Transition Complexity of Incomplete DFAs. Fundam. Inform. 110(1-4): 143-158 (2011)
[j78]Kai Salomaa: Limitations of lower bound methods for deterministic nested word automata. Inf. Comput. 209(3): 580-589 (2011)
[j77]Yo-Sub Han, Kai Salomaa: Overlap-Free Languages and solid Codes. Int. J. Found. Comput. Sci. 22(5): 1197-1209 (2011)
[j76]
[j75]Erzsébet Csuhaj-Varjú, Kai Salomaa: Editorial: Computing with biomolecules. Natural Computing 10(2): 775-776 (2011)
[j74]Cristian S. Calude, Kai Salomaa, Tania Roblot: Finite state complexity. Theor. Comput. Sci. 412(41): 5668-5677 (2011)
[c62]Xiaoxue Piao, Kai Salomaa, Sándor Vágvölgyi: Tree Homomorphisms for Unranked Trees. AFL 2011: 343-357
[c61]Michael Domaratzki, Kai Salomaa: On Language Decompositions and Primality. Rainbow of Computer Science 2011: 63-75
[c60]
[c59]Alexander Okhotin, Kai Salomaa: Descriptional Complexity of Unambiguous Nested Word Automata. LATA 2011: 414-426
[c58]Arto Salomaa, Kai Salomaa, Sheng Yu: Undecidability of the State Complexity of Composed Regular Operations. LATA 2011: 489-498
[c57]Alexander Okhotin, Kai Salomaa: State Complexity of Operations on Input-Driven Pushdown Automata. MFCS 2011: 485-496
[c56]David Sears, Kai Salomaa: Extended Watson-Crick L Systems with Regular Trigger Languages. UC 2011: 212-223
[e2]Michael Domaratzki, Kai Salomaa (Eds.): Implementation and Application of Automata - 15th International Conference, CIAA 2010, Winnipeg, MB, Canada, August 12-15, 2010. Revised Selected Papers. Lecture Notes in Computer Science 6482, Springer 2011, ISBN 978-3-642-18097-2- 2010
[j73]Adam Clarridge, Kai Salomaa: An Improved Cellular Automata Based Algorithm for the 45-Convex Hull Problem. J. Cellular Automata 5(1-2): 107-120 (2010)
[j72]Mark Daley, Michael Domaratzki, Kai Salomaa: Orthogonal Concatenation: Language Equations and State Complexity. J. UCS 16(5): 653-675 (2010)
[j71]Adam Clarridge, Kai Salomaa: Analysis of a cellular automaton model for car traffic with a slow-to-stop rule. Theor. Comput. Sci. 411(38-39): 3507-3515 (2010)
[c55]Cristian Calude, Kai Salomaa, Tania Roblot: Finite-State Complexity and the Size of Transducers. DCFS 2010: 38-47
[c54]
[c53]Xiaoxue Piao, Kai Salomaa: Operational State Complexity of Deterministic Unranked Tree Automata. DCFS 2010: 149-158
[c52]Xiaoxue Piao, Kai Salomaa: Transformations Between Different Types of Unranked Bottom-Up Tree Automata. DCFS 2010: 159-168
[c51]Yo-Sub Han, Kai Salomaa: Nondeterministic State Complexity for Suffix-Free Regular Languages. DCFS 2010: 189-196
2000 – 2009
- 2009
[j70]Yo-Sub Han, Kai Salomaa, Derick Wood: Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages. Fundam. Inform. 90(1-2): 93-106 (2009)
[j69]Arto Salomaa, Kai Salomaa, Sheng Yu: Variants of codes and indecomposable languages. Inf. Comput. 207(11): 1340-1349 (2009)
[j68]Yo-Sub Han, Kai Salomaa: State complexity of basic operations on suffix-free regular languages. Theor. Comput. Sci. 410(27-29): 2537-2548 (2009)
[j67]Yo-Sub Han, Kai Salomaa: Nondeterministic state complexity of nested word automata. Theor. Comput. Sci. 410(30-32): 2961-2971 (2009)
[j66]Franziska Biegler, Kai Salomaa: On the synchronized derivation depth of context-free grammars. Theor. Comput. Sci. 410(35): 3198-3208 (2009)
[j65]Elena Czeizler, Eugen Czeizler, Lila Kari, Kai Salomaa: On the descriptional complexity of Watson-Crick automata. Theor. Comput. Sci. 410(35): 3250-3260 (2009)
[j64]Xiaoxue Piao, Kai Salomaa: Operational state complexity of nested word automata. Theor. Comput. Sci. 410(35): 3290-3302 (2009)
[j63]Kai Salomaa, Sheng Yu, Jinfeng Zan: Deciding determinism of caterpillar expressions. Theor. Comput. Sci. 410(37): 3438-3446 (2009)
[c50]Yo-Sub Han, Kai Salomaa, Derick Wood: Operational State Complexity of Prefix-Free Regular Languages. Automata, Formal Languages, and Related Topics 2009: 99-115
[c49]
[c48]Adam Clarridge, Kai Salomaa: A Cryptosystem Based on the Composition of Reversible Cellular Automata. LATA 2009: 314-325
[c47]Yo-Sub Han, Kai Salomaa, Sheng Yu: State Complexity of Combined Operations for Prefix-Free Regular Languages. LATA 2009: 398-409
[c46]Adam Clarridge, Kai Salomaa: A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule. CIAA 2009: 44-53
[i1]Mark Daley, Michael Domaratzki, Kai Salomaa: State complexity of orthogonal catenation. CoRR abs/0904.3366 (2009)- 2008
[j62]Yuan Gao, Kai Salomaa, Sheng Yu: The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal. Fundam. Inform. 83(1-2): 75-89 (2008)
[j61]Yo-Sub Han, Kai Salomaa: State Complexity of Union and Intersection of Finite Languages. Int. J. Found. Comput. Sci. 19(3): 581-595 (2008)
[j60]
[j59]Michael Domaratzki, Kai Salomaa: Lower bounds for the transition complexity of NFAs. J. Comput. Syst. Sci. 74(7): 1116-1130 (2008)
[c45]Franziska Biegler, Kai Salomaa: On the Synchronized Derivation Depth of Context-Free Grammars. DCFS 2008: 73-84
[c44]Elena Czeizler, Eugen Czeizler, Lila Kari, Kai Salomaa: Watson-Crick automata: determinism and state complexity. DCFS 2008: 121-133
[c43]Mark Daley, Michael Domaratzki, Kai Salomaa: State Complexity of Orthogonal Catenation. DCFS 2008: 134-144
[c42]
[c41]Arto Salomaa, Kai Salomaa, Sheng Yu: Length Codes, Products of Languages and Primality. LATA 2008: 476-486
[c40]- 2007
[j58]Yo-Sub Han, Kai Salomaa, Derick Wood: Intercode Regular Languages. Fundam. Inform. 76(1-2): 113-128 (2007)
[j57]Kai Salomaa, Sheng Yu: On the State Complexity of Combined Operations and their Estimation. Int. J. Found. Comput. Sci. 18(4): 683-698 (2007)
[j56]Kai Salomaa, Paul Schofield: State Complexity of Additive Weighted Finite Automata. Int. J. Found. Comput. Sci. 18(6): 1407-1416 (2007)
[j55]Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu: On the existence of prime decompositions. Theor. Comput. Sci. 376(1-2): 60-69 (2007)
[j54]Arto Salomaa, Kai Salomaa, Sheng Yu: State complexity of combined operations. Theor. Comput. Sci. 383(2-3): 140-152 (2007)
[j53]Franziska Biegler, Ian McQuillan, Kai Salomaa: An infinite hierarchy induced by depth synchronization. Theor. Comput. Sci. 387(2): 113-124 (2007)
[j52]Brendan J. Cordy, Kai Salomaa: On the existence of regular approximations. Theor. Comput. Sci. 387(2): 125-135 (2007)
[j51]Michael Domaratzki, Kai Salomaa: Transition complexity of language operations. Theor. Comput. Sci. 387(2): 147-154 (2007)
[c39]Kai Salomaa: Descriptional Complexity of Nondeterministic Finite Automata. Developments in Language Theory 2007: 31-35
[c38]Yo-Sub Han, Kai Salomaa: State Complexity of Union and Intersection of Finite Languages. Developments in Language Theory 2007: 217-228
[c37]Yo-Sub Han, Kai Salomaa: State Complexity of Basic Operations on Suffix-Free Regular Languages. MFCS 2007: 501-512
[c36]- 2006
[j50]Michael Domaratzki, Grzegorz Rozenberg, Kai Salomaa: Interpreted Trajectories. Fundam. Inform. 73(1-2): 81-97 (2006)
[j49]Michael Domaratzki, Kai Salomaa: Codes defined by multiple sets of trajectories. Theor. Comput. Sci. 366(3): 182-193 (2006)
[c35]Ian McQuillan, Kai Salomaa, Mark Daley: Iterated TGR Languages: Membership Problem and Effective Closure Properties. COCOON 2006: 94-103
[c34]Franziska Biegler, Ian McQuillan, Kai Salomaa: An Infinite Hierarchy Induced by Depth Synchronization. DCFS 2006: 82-93
[c33]
[c32]
[c31]
[c30]Yo-Sub Han, Kai Salomaa, Derick Wood: State Complexity of Prefix-Free Regular Languages. DCFS 2006: 165-176
[c29]Yo-Sub Han, Kai Salomaa, Derick Wood: Prime Decompositions of Regular Languages. Developments in Language Theory 2006: 145-155
[c28]Michael Domaratzki, Kai Salomaa: Lower Bounds for the Transition Complexity of NFAs. MFCS 2006: 315-326- 2005
[j48]Alexander Okhotin, Kai Salomaa: Contextual Grammars with Uniform Sets of Trajectories. Fundam. Inform. 64(1-4): 341-351 (2005)
[j47]
[j46]Michael Domaratzki, Kai Salomaa: Restricted sets of trajectories and decidability of shuffle decompositions. Int. J. Found. Comput. Sci. 16(5): 897-912 (2005)
[j45]Michael Domaratzki, Kai Salomaa: Decidability of trajectory-based equations. Theor. Comput. Sci. 345(2-3): 304-330 (2005)- 2004
[j44]Michael Domaratzki, Kai Salomaa: State Complexity of Shuffle on Trajectories. Journal of Automata, Languages and Combinatorics 9(2/3): 217-232 (2004)
[c27]Kai Salomaa, Derick Wood: Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof. Theory Is Forever 2004: 259-267
[c26]Michael Domaratzki, Kai Salomaa: Restricted sets of trajectories and decidability of shuffle decompositions. DCFS 2004: 37-51
[c25]
[e1]Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu (Eds.): Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3317, Springer 2004, ISBN 3-540-24318-6- 2003
[j43]Cezar Câmpeanu, Kai Salomaa, Sheng Yu: A Formal Study Of Practical Regular Expressions. Int. J. Found. Comput. Sci. 14(6): 1007-1018 (2003)- 2002
[j42]Alexander Okhotin, Kai Salomaa, Michael Domaratzki: One-Visit Caterpillar Tree Automata. Fundam. Inform. 52(4): 361-375 (2002)
[j41]Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi: Shuffle Decompositions of Regular Languages. Int. J. Found. Comput. Sci. 13(6): 799-816 (2002)
[j40]Cezar Câmpeanu, Kai Salomaa, Sheng Yu: Tight Lower Bound for the State Complexity of Shuffle of Regular Languages. Journal of Automata, Languages and Combinatorics 7(3): 303-310 (2002)
[j39]Cristian Calude, Kai Salomaa, Sheng Yu: Advances and Trends in Automata and Formal Languages A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen - J.UCS Special Issue. J. UCS 8(2): 117-118 (2002)
[j38]Cristian Calude, Kai Salomaa, Sheng Yu: Additive Distances and Quasi-Distances Between Words. J. UCS 8(2): 141-152 (2002)
[j37]Kai Salomaa, Sheng Yu: Decidability of EDT0L structural equivalence. Theor. Comput. Sci. 276(1-2): 245-259 (2002)
[c24]
[c23]- 2001
[j36]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: A sharpening of the Parikh mapping. ITA 35(6): 551-564 (2001)
[j35]Markus Holzer, Kai Salomaa, Sheng Yu: On the State Complexity of k-Entry Deterministic Finite Automata. Journal of Automata, Languages and Combinatorics 6(4): 453-466 (2001)
[c22]Cezar Câmpeanu, Kai Salomaa, Sándor Vágvölgyi: Shuffle Quotient and Decompositions. Developments in Language Theory 2001: 186-196- 2000
[j34]Alexandru Mateescu, Kai Salomaa, Sheng Yu: On Fairness of Many-Dimensional Trajectories. Journal of Automata, Languages and Combinatorics 5(2): 145-158 (2000)
[j33]Kai Salomaa, Xiuming Wu, Sheng Yu: Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata. Theor. Comput. Sci. 231(1): 103-111 (2000)
[j32]Kai Salomaa, Sheng Yu: Alternating finite automata and star-free languages. Theor. Comput. Sci. 234(1-2): 167-176 (2000)
1990 – 1999
- 1999
[j31]Kai Salomaa, Sheng Yu: Generalized Fairness and Context-Free Languages. Acta Cybern. 14(1): 193-204 (1999)
[j30]
[c21]Kai Salomaa, Sheng Yu: Synchronization Expressions: Characterization Results and Implementation. Jewels are Forever 1999: 45-56
[c20]
[c19]Cezar Câmpeanu, Karel Culik II, Kai Salomaa, Sheng Yu: State Complexity of Basic Operations on Finite Languages. WIA 1999: 60-70- 1998
[j29]George Rahonis, Kai Salomaa: On the Size of Stack and Synchronization Alphabets of Tree Automata. Fundam. Inform. 36(1): 57-69 (1998)
[j28]Kai Salomaa, Sheng Yu: Synchronization Expressions with Extended Join Operation. Theor. Comput. Sci. 207(1): 73-88 (1998)
[c18]Sandra Huerter, Kai Salomaa, Xiuming Wu, Sheng Yu: Implementing Reversed Alternating Finite Automaton (r-AFA) Operations. Workshop on Implementing Automata 1998: 69-81- 1997
[j27]Andrzej Ehrenfeucht, Grzegorz Rozenberg, Kai Salomaa: Semantics of Nonsequential Tree-Based Computation Schemes. Fundam. Inform. 29(4): 305-324 (1997)
[j26]Kai Salomaa, Sheng Yu: NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets. Journal of Automata, Languages and Combinatorics 2(3): 177-186 (1997)
[c17]Helmut Jürgensen, Kai Salomaa: Block-Synchronization Context-Free Grammars. Advances in Algorithms, Languages, and Complexity 1997: 111-137
[c16]Kai Salomaa, Sheng Yu: Rewriting Rules for Synchronization Languages. Structures in Logic and Computer Science 1997: 322-338
[c15]Alexandru Mateescu, Kai Salomaa, Sheng Yu: Decidability of fairness for context-free languages. Developments in Language Theory 1997: 351-364
[c14]George Rahonis, Kai Salomaa: Hierarchies of synchronized and algebraic forests. Developments in Language Theory 1997: 447-460
[c13]Kai Salomaa, Xiuming Wu, Sheng Yu: Efficient Implementation of Regular Languages Using R-AFA. Workshop on Implementing Automata 1997: 176-184- 1996
[j25]
[j24]Kai Salomaa: Yield-Languages of Two-Way Pushdown Tree Automata. Inf. Process. Lett. 58(4): 195-199 (1996)
[j23]Kai Salomaa: On the Modularity of Decidability of Completeness and Termination. Journal of Automata, Languages and Combinatorics 1(1): 37-54 (1996)
[j22]Kai Salomaa, Derick Wood, Sheng Yu: Structural Equivalence and ET0L Grammars. Theor. Comput. Sci. 164(1&2): 123-140 (1996)
[j21]Kai Salomaa: Decidability of Equivalence for Deterministic Synchronized Tree Automata. Theor. Comput. Sci. 167(1&2): 171-192 (1996)
[c12]Kai Salomaa, Sheng Yu: NFA to DFA Transformation for Finite Languages. Workshop on Implementing Automata 1996: 149-158- 1995
[j20]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: P, NP and the Post Correspondence Problem. Inf. Comput. 121(2): 135-142 (1995)
[j19]Kai Salomaa, Derick Wood, Sheng Yu: Complexity of E0L Structural Equivalence. ITA 29(6): 471-485 (1995)
[j18]Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu: Decision Problems for Patterns. J. Comput. Syst. Sci. 50(1): 53-63 (1995)
[j17]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. J. UCS 1(5): 292-311 (1995)
[c11]Kai Salomaa, Sheng Yu: Nondeterminism Degrees for Context-Free Languages. Developments in Language Theory 1995: 154-165
[c10]Kai Salomaa: Decidability of Equivalence for Deterministic Synchronized Tree Automata. TAPSOFT 1995: 140-154- 1994
[j16]
[j15]Kai Salomaa, Sheng Yu: Measures of Nondeterminism for Pushdown Automata. J. Comput. Syst. Sci. 49(2): 362-374 (1994)
[j14]Andrzej Ehrenfeucht, Grzegorz Rozenberg, Kai Salomaa: Semantics of Trees. Mathematical Systems Theory 27(2): 159-181 (1994)
[j13]Sheng Yu, Qingyu Zhuang, Kai Salomaa: The State Complexities of Some Basic Operations on Regular Languages. Theor. Comput. Sci. 125(2): 315-328 (1994)
[j12]
[j11]Helmut Jürgensen, Kai Salomaa, Sheng Yu: Transducers and the Decidability of Independence in Free Monoids. Theor. Comput. Sci. 134(1): 107-117 (1994)
[c9]Kai Salomaa, Derick Wood, Sheng Yu: Rediscovering Pushdown Machines. Results and Trends in Theoretical Computer Science 1994: 372-385
[c8]- 1993
[j10]
[j9]Helmut Jürgensen, Kai Salomaa, Sheng Yu: Decidability of the Intercode Property. Elektronische Informationsverarbeitung und Kybernetik 29(6): 375-380 (1993)
[c7]Kai Salomaa, Derick Wood, Sheng Yu: Structural Equivalences and ET0L Grammars (Extended Abstract). FCT 1993: 430-439
[c6]Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu: Inclusion is Undecidable for Pattern Languages. ICALP 1993: 301-312- 1992
[j8]
[j7]Kai Salomaa: Confluence, ground confluence, and termination of monadic term rewriting systems. Elektronische Informationsverarbeitung und Kybernetik 28(5): 279-309 (1992)
[c5]Sheng Yu, Qingyu Zhuang, Kai Salomaa: Obtaining Tight Upper Bounds for the State Complexities of DFA Operations. ICCI 1992: 100-104- 1991
[j6]Arto Salomaa, Kai Salomaa, Sheng Yu: Primary Types of Instances of the Post Correspondence Problem. Bulletin of the EATCS 44: 226-241 (1991)
[j5]Kai Salomaa, Sheng Yu: Decidability of Structural Equivalence of E0L Grammars. Theor. Comput. Sci. 82(1): 131-139 (1991)
[c4]
[c3]Kai Salomaa: Decidability of Confluence and Termination of Monadic Term Rewriting Systems. RTA 1991: 275-286- 1990
[j4]Kai Salomaa, Sheng Yu: The Immortality Problem for LAG Systems. Inf. Process. Lett. 36(6): 311-315 (1990)
1980 – 1989
- 1989
[c2]Kai Salomaa: Representation of Recursively Enumerable Languages Using Alternating Finite Tree Recognizers. FCT 1989: 372-383- 1988
[j3]
[j2]Kai Salomaa: Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. J. Comput. Syst. Sci. 37(3): 367-394 (1988)- 1986
[c1]- 1984
[j1]H. C. M. Kleijn, Martti Penttonen, Grzegorz Rozenberg, Kai Salomaa: Direction Independent Context-Sensitive Grammars. Information and Control 63(1/2): 113-117 (1984)
Coauthor Index
[j79] [c58] [c54] [j69] [j63] [c47] [j62] [c41] [j57] [j55] [j54] [c36] [c31] [j47] [e1] [j43] [j40] [j39] [j38] [j37] [c23] [j36] [j35] [j34] [j33] [j32] [j31] [j30] [c21] [c20] [c19] [j28] [c18] [j26] [c16] [c15] [c13] [j25] [j22] [c12] [j20] [j19] [j18] [j17] [c11] [j16] [j15] [j13] [j11] [c9] [c8] [j10] [j9] [c7] [c6] [c5] [j6] [j5] [c4] [j4]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-17 17:53 CET by the dblp team



