dblp.uni-trier.dewww.uni-trier.de

Zoltán Ésik Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
147 Zoltán Ésik, Zoltán Fülöp: Automata, Formal Languages, and Related Topics - Dedicated to Ferenc Gécseg on the occasion of his 70th birthday Institute of Informatics, University of Szeged, Hungary 2009
146EEStephen L. Bloom, Zoltán Ésik, Werner Kuich: Cycle-Free Finite Automata in Partial Iterative Semirings. CAI 2009: 1-12
145EEZoltán Ésik, T. Hajgató: Iteration Grove Theories with Applications. CAI 2009: 227-249
144EEZoltán Ésik, Szabolcs Iván: Context-Free Languages of Countable Words. ICTAC 2009: 185-199
143EEStephen L. Bloom, Zoltán Ésik: Algebraic Ordinals CoRR abs/0907.0877: (2009)
142EEStephen L. Bloom, Zoltán Ésik: Axiomatizing rational power series over natural numbers. Inf. Comput. 207(7): 793-811 (2009)
141EEZoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu: Estimation of state complexity of combined operations. Theor. Comput. Sci. 410(35): 3272-3280 (2009)
2008
140EEZoltán Ésik, Szabolcs Iván: Games for Temporal Logics on Trees. CIAA 2008: 191-200
139EEZoltán Ésik: Iteration Semirings. Developments in Language Theory 2008: 1-20
138EEZoltán Ésik, Szabolcs Iván: Products of Tree Automata with an Application to Temporal Logic. Fundam. Inform. 82(1-2): 61-78 (2008)
137EEZoltán Ésik, Szabolcs Iván: Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics. Fundam. Inform. 82(1-2): 79-103 (2008)
136EEStephen L. Bloom, Zoltán Ésik, Werner Kuich: Partial Conway and Iteration Semirings. Fundam. Inform. 86(1-2): 19-40 (2008)
2007
135 Erzsébet Csuhaj-Varjú, Zoltán Ésik: Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings Springer 2007
134EEZoltán Ésik, Szabolcs Iván: Aperiodicity in Tree Automata. CAI 2007: 189-207
133EEStephen L. Bloom, Zoltán Ésik: Regular and Algebraic Words and Ordinals. CALCO 2007: 1-15
132 Zoltán Ésik, Gabriela Martín: An Algebraic Characterization of Wolper's Logic. FCS 2007: 139-143
131EEZoltán Ésik, Pascal Weil: Algebraic characterization of logically defined tree languages CoRR abs/0709.2962: (2007)
130EEStephen L. Bloom, Zoltán Ésik: Axiomatizing rational power series CoRR abs/0712.1337: (2007)
129EEStephen L. Bloom, Zoltán Ésik, Werner Kuich: Partial Conway and iteration semirings CoRR abs/0712.2952: (2007)
128EEZoltán Ésik, Guangwu Liu: Fuzzy tree automata. Fuzzy Sets and Systems 158(13): 1450-1460 (2007)
127EEZoltán Ésik, Werner Kuich: Boolean Fuzzy Sets. Int. J. Found. Comput. Sci. 18(6): 1197-1207 (2007)
126 Zoltán Ésik, Werner Kuich: A Semiring-Semimodule Generalization of Transducers and Abstract omega-Families of Power Series. Journal of Automata, Languages and Combinatorics 12(4): 435-454 (2007)
2006
125 Zoltán Ésik, Carlos Martín-Vide, Victor Mitrana: Recent Advances in Formal Languages and Applications Springer 2006
124 Zoltán Ésik: Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings Springer 2006
123EEStephen L. Bloom, Zoltán Ésik: Completing Categorical Algebras. IFIP TCS 2006: 231-249
122EEZoltán Ésik, Pascal Weil: Algebraic recognizability of regular tree languages CoRR abs/cs/0609113: (2006)
121EEZoltán Ésik: Cascade Products and Temporal Logics on Finite Trees. Electr. Notes Theor. Comput. Sci. 162: 163-166 (2006)
120EEAlberto Bertoni, Zoltán Ésik, Juhani Karhumäki: Preface. Theor. Comput. Sci. 356(1-2): 1-5 (2006)
119EEZoltán Ésik: Characterizing CTL-like logics on finite trees. Theor. Comput. Sci. 356(1-2): 136-152 (2006)
118EEZoltán Ésik: Preface. Theor. Comput. Sci. 366(3): 181 (2006)
2005
117EEZoltán Ésik, Hans Leiß: Algebraically complete semirings and Greibach normal form. Ann. Pure Appl. Logic 133(1-3): 173-203 (2005)
116EEStephen L. Bloom, Zoltán Ésik: The equational theory of regular words. Inf. Comput. 197(1-2): 55-89 (2005)
115 Zoltán Ésik, Werner Kuich: A Semiring-Semimodule Generalization of ?-Regular Languages I. Journal of Automata, Languages and Combinatorics 10(2/3): 203-242 (2005)
114 Zoltán Ésik, Werner Kuich: A Semiring-Semimodule Generalization of ?-Regular Languages II. Journal of Automata, Languages and Combinatorics 10(2/3): 243-264 (2005)
113EELuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Zoltán Ésik: Guest editors' foreword: Process Algebra. Theor. Comput. Sci. 335(2-3): 127-129 (2005)
112EEZoltán Ésik, Pascal Weil: Algebraic recognizability of regular tree languages. Theor. Comput. Sci. 340(1): 291-321 (2005)
2004
111EEZoltán Ésik, Werner Kuich: An Algebraic Generalization of omega-Regular Languages. MFCS 2004: 648-659
110EEZoltán Ésik, Werner Kuich: A Semiring-Semimodule Generalization of omega-Context-Free Languages. Theory Is Forever 2004: 68-80
109 Zoltán Ésik, Zoltán L. Németh: Higher Dimensional Automata. Journal of Automata, Languages and Combinatorics 9(1): 3-29 (2004)
108EEZoltán Ésik, Werner Kuich: Inductive star-semirings. Theor. Comput. Sci. 324(1): 3-33 (2004)
107EEZoltán Ésik, Zoltán Fülöp: Foreword. Theor. Comput. Sci. 327(3): 223-224 (2004)
2003
106 Zoltán Ésik, Zoltán Fülöp: Developments in Language Theory, 7th International Conference, DLT 2003, Szeged, Hungary, July 7-11, 2003, Proceedings Springer 2003
105EEZoltán Ésik, Pascal Weil: On Logically Defined Recognizable Tree Languages. FSTTCS 2003: 195-207
104EEStephen L. Bloom, Zoltán Ésik: Axioms for Regular Words: Extended Abstract. FSTTCS 2003: 50-61
103EEZoltán Ésik, Masami Ito: Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automata. Acta Cybern. 16(1): 1-28 (2003)
102EEJanusz A. Brzozowski, Zoltán Ésik: Hazard Algebras. Formal Methods in System Design 23(3): 223-256 (2003)
101EEStephen L. Bloom, Zoltán Ésik: Deciding whether the frontier of a regular tree is scattered. Fundam. Inform. 55(1): 1-21 (2003)
100EEZoltán Ésik, Kim Guldstrand Larsen: Regular languages definable by Lindström quantifiers. ITA 37(3): 179-241 (2003)
99 Zoltán Ésik, Anna Ingólfsdóttir: Foreword. ITA 37(4): 272 (2003)
98 Stephen L. Bloom, Zoltán Ésik: An Extension Theorem with an Application to Formal Tree Series. Journal of Automata, Languages and Combinatorics 8(2): 145-185 (2003)
97 Zoltán Ésik, Werner Kuich: Formal Tree Series. Journal of Automata, Languages and Combinatorics 8(2): 219-285 (2003)
96EELuca Aceto, Zoltán Ésik, Anna Ingólfsdóttir: Equational theories of tropical semirings. Theor. Comput. Sci. 3(298): 417-469 (2003)
2002
95 Zoltán Ésik, Anna Ingólfsdóttir: Fixed Points in Computer Science, FICS 2002, Copenhagen, Denmark, 20-21 July 2002, Preliminary Proceedings University of Aarhus 2002
94EELuca Aceto, Zoltán Ésik, Anna Ingólfsdóttir: Equational Axioms for Probabilistic Bisimilarity. AMAST 2002: 239-253
93EEZoltán Ésik, Hans Leiß: Greibach Normal Form in Algebraically Complete Semirings. CSL 2002: 135-150
92EEZoltán Ésik: Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators. Developments in Language Theory 2002: 43-58
91EEStephen L. Bloom, Zoltán Ésik: Unique, guarded fixed points in an additive setting: Extended Abstract. Electr. Notes Theor. Comput. Sci. 69: (2002)
90EELuca Aceto, Zoltán Ésik, Anna Ingólfsdóttir: A Fully Equational Proof of Parikh's Theorem. ITA 36(2): 129-153 (2002)
89EEZoltán Ésik: Continuous Additive Algebras and Injective Simulations of Synchronization Trees. J. Log. Comput. 12(2): 271-300 (2002)
88EEZoltán Ésik, Werner Kuich: Rationally Additive Semirings. J. UCS 8(2): 173-183 (2002)
87EEZoltán Ésik: Axiomatizing the subsumption and subword preorders on finite and infinite partial words. Theor. Comput. Sci. 273(1-2): 225-248 (2002)
2001
86EEZoltán Ésik: The Equational Theory of Fixed Points with Applications to Generalized Language Theory. Developments in Language Theory 2001: 21-36
85EEZoltán Ésik, Zoltán L. Németh: Automata on Series-Parallel Biposets. Developments in Language Theory 2001: 217-227
84EELuca Aceto, Zoltán Ésik, Anna Ingólfsdóttir: Axiomatizing Tropical Semirings. FoSSaCS 2001: 42-56
83 Janusz A. Brzozowski, Zoltán Ésik, Y. Iland: Algebras for Hazard Detection. ISMVL 2001: 3-
82 Zoltán Ésik, Werner Kuich: A Generation of Kozen's Axiomatization of the Equational Theory of the Regular Sets. Words, Semigroups, and Transductions 2001: 99-114
81EEStephen L. Bloom, Zoltán Ésik, Anna Labella, Ernest G. Manes: Iteration 2-theories. Applied Categorical Structures 9(2): 173-216 (2001)
80 Sinisa Crvenkovic, Igor Dolinka, Zoltán Ésik: On Equations for Union-Free Regular Languages. Inf. Comput. 164(1): 152-172 (2001)
79 Pál Dömösi, Zoltán Ésik: Homomorphic Simulation and Letichevsky's Criterion. Journal of Automata, Languages and Combinatorics 6(4): 427-436 (2001)
2000
78 Janusz A. Brzozowski, Zoltán Ésik: Hazard Algebras (Extended Abstract). A Half-Century of Automata Theory 2000: 1-19
77EEZoltán Ésik: Axiomatizing the Least Fixed Point Operation and Binary Supremum. CSL 2000: 302-316
76 Stephen L. Bloom, Zoltán Ésik: Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract. LATIN 2000: 367-376
75EEZoltán Ésik: Iteration Theories of Boolean Functions. MFCS 2000: 343-352
74EELuca Aceto, Zoltán Ésik, Anna Ingólfsdóttir: On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers. STACS 2000: 267-278
73EEZoltán Ésik: The Power of the Group-Identities for Iteration. IJAC 10(3): 349-374 (2000)
72 Zoltán Ésik, Werner Kuich: A Kleene Theorem for Lindenmayerian Algebraic Power Series. Journal of Automata, Languages and Combinatorics 5(2): 109-122 (2000)
71EESinisa Crvenkovic, Igor Dolinka, Zoltán Ésik: The Variety of Kleene Algebras with Conversion is not Finitely Based. Theor. Comput. Sci. 230(1-2): 235-245 (2000)
70EEZoltán Ésik: A proof of the Krohn-Rhodes Decomposition Theorem. Theor. Comput. Sci. 234(1-2): 287-300 (2000)
1999
69EEZoltán Ésik, Satoshi Okawa: Series and Parallel Operations on Pomsets. FSTTCS 1999: 316-328
68EEZoltán Ésik: Axiomatizing Iteration Categories. Acta Cybern. 14(1): 65-82 (1999)
67 Zoltán Ésik: Group Axioms for Iteration. Inf. Comput. 148(2): 131-180 (1999)
66EESinisa Crvenkovic, Igor Dolinka, Zoltán Ésik: A Note on Equations for Commutative Regular Languages. Inf. Process. Lett. 70(6): 265-267 (1999)
1998
65EEZoltán Ésik: Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract). STACS 1998: 455-465
64EEZoltán Ésik, Michael Bertol: Nonfinite Axiomatizability of the Equational Theory of Shuffle. Acta Inf. 35(6): 505-539 (1998)
63 L. Bernátsky, Zoltán Ésik: Semantics on Flowchart Programs and the Free Conway Theories. ITA 32(1-3): 35-78 (1998)
62EEZoltán Ésik, Anna Labella: Equational Properties of Iteration in Algebraically Complete Categories. Theor. Comput. Sci. 195(1): 61-89 (1998)
1997
61 Stephen L. Bloom, Anna Labella, Zoltán Ésik, Ernest G. Manes: Iteration 2-Theories: Extended Abstract. AMAST 1997: 30-44
60 Stephen L. Bloom, Zoltán Ésik: Axiomatizing Shuffle and Concatenation in Languages. Inf. Comput. 139(1): 62-91 (1997)
59 Stephen L. Bloom, Zoltán Ésik: Varieties Generated by Languages with Poset Operations. Mathematical Structures in Computer Science 7(6): 701-713 (1997)
58EEZoltán Ésik: Completeness of Park Induction. Theor. Comput. Sci. 177(1): 217-283 (1997)
57EEStephen L. Bloom, Zoltán Ésik: The Equational Logic of Fixed Points (Tutorial). Theor. Comput. Sci. 179(1-2): 1-60 (1997)
1996
56EEZoltán Ésik, Anna Labella: Equational Properties of Iteration in Algebraically Complete Categories. MFCS 1996: 336-347
55 Stephen L. Bloom, Zoltán Ésik: Two Axiomatizations of a Star Semiring Quasi-Variety. Bulletin of the EATCS 59: (1996)
54EEStephen L. Bloom, Zoltán Ésik: Fixed-Point Operations on ccc's. Part I. Theor. Comput. Sci. 155(1): 1-38 (1996)
53EEStephen L. Bloom, Zoltán Ésik: Free Shuffle Algebras in Language Varieties. Theor. Comput. Sci. 163(1&2): 55-98 (1996)
1995
52EEZoltán Ésik, Michael Bertol: Nonfinite Axiomatizability of the Equational Theory of Shuffle. ICALP 1995: 27-38
51 Stephen L. Bloom, Zoltán Ésik: Free Shuffle Algebras in Language Varieties (Extended Abstract). LATIN 1995: 99-111
50EEStephen L. Bloom, Zoltán Ésik: Nonfinite Axiomatizability of Shuffle Inequalities. TAPSOFT 1995: 318-333
49EEZoltán Ésik, L. Bernátsky: Scott induction and equational proofs. Electr. Notes Theor. Comput. Sci. 1: (1995)
48 Stephen L. Bloom, Zoltán Ésik: Some Equational Laws of Initiality in 2CCC's. Int. J. Found. Comput. Sci. 6(2): 95-118 (1995)
47EEZoltán Ésik, L. Bernátsky: Equational Properties of Kleene Algebras of Relations with Conversion. Theor. Comput. Sci. 137(2): 237-251 (1995)
1994
46EEStephen L. Bloom, Zoltán Ésik: Solving Polynomial Fixed Point Equations. MFCS 1994: 52-67
1993
45 Zoltán Ésik: Fundamentals of Computation Theory, 9th International Symposium, FCT '93, Szeged, Hungary, August 23-27, 1993, Proceedings Springer 1993
44EEStephen L. Bloom, Zoltán Ésik: Some Quasi-Varieties of Iteration Theories. MFPS 1993: 378-409
43 Stephen L. Bloom, Zoltán Ésik, Dirk Taubner: Iteration Theories of Synchronization Trees Inf. Comput. 102(1): 1-55 (1993)
42 Stephen L. Bloom, Zoltán Ésik: Erratum: Iteration Algebras. Int. J. Found. Comput. Sci. 4(1): 99 (1993)
41 Stephen L. Bloom, Zoltán Ésik: Matrix and Matricial Iteration Theories, Part I. J. Comput. Syst. Sci. 46(3): 381-408 (1993)
40 Stephen L. Bloom, Zoltán Ésik: Matrix and Matricial Iteration Theories, Part II. J. Comput. Syst. Sci. 46(3): 409-439 (1993)
39 Stephen L. Bloom, Zoltán Ésik: Equational Axioms for Regular Sets. Mathematical Structures in Computer Science 3(1): 1-24 (1993)
1992
38 Stephen L. Bloom, Zoltán Ésik: Iteration Algebras. Int. J. Found. Comput. Sci. 3(3): 245-302 (1992)
1991
37EEStephen L. Bloom, Zoltán Ésik: Program Correctness and Matricial Iteration Theories. MFPS 1991: 457-476
36EEStephen L. Bloom, Zoltán Ésik: Iteration Algebras (Extended Abstract). TAPSOFT, Vol.1 1991: 264-274
35 Stephen L. Bloom, Zoltán Ésik: Cayley iff Stone. Bulletin of the EATCS 43: 159-161 (1991)
34EEZoltán Ésik: A note on isomorphic simulation of automata by networks of two-state automata. Discrete Applied Mathematics 30(1): 77-82 (1991)
33EEStephen L. Bloom, Zoltán Ésik: Floyd-Hoare Logic in Iteration Theories. J. ACM 38(4): 887-934 (1991)
32 Zoltán Ésik: Results on Homomorphic Realization of Automata by alpha_0-Products. Theor. Comput. Sci. 87(2): 229-249 (1991)
1990
31 Pál Dömösi, Zoltán Ésik: Product hierarchies of automata and homomorphic simulation. Acta Cybern. 9(4): 371-373 (1990)
30 Zoltán Ésik: A note on the axiomatization of iteration theories. Acta Cybern. 9(4): 375-384 (1990)
1989
29 Pál Dömösi, Zoltán Ésik, Balázs Imreh: On Product Hierarchies of Automata. FCT 1989: 137-144
28 Stephen L. Bloom, Zoltán Ésik: Equational Logic of Circular Data Type Specification. Theor. Comput. Sci. 63(3): 303-331 (1989)
1988
27EEZoltán Ésik: An Extension of the Krohn-Rhodes Decomposition of Automata. IMYCS 1988: 66-71
26 Pál Dömösi, Zoltán Ésik: On the hiearchy of nui-product. Acta Cybern. 8: 253-257 (1988)
25 Pál Dömösi, Zoltán Ésik: On homomorphic simulation of automata by alphai-producst. Acta Cybern. 8: 315-323 (1988)
24 Zoltán Ésik: Independence of the Equational Axioms for Iteration Theories. J. Comput. Syst. Sci. 36(1): 66-76 (1988)
23 Stephen L. Bloom, Zoltán Ésik: Varieties of Iteration Theories. SIAM J. Comput. 17(5): 939-966 (1988)
22 Pál Dömösi, Zoltán Ésik: Critical Classes for the alpha_0-Product. Theor. Comput. Sci. 61: 17-24 (1988)
1987
21 Zoltán Ésik: On isomorphic realization of automata with alphai-products. Acta Cybern. 8: 119-127 (1987)
20 Zoltán Ésik, J. Virágh: A note on alpha0* - products of aperiodic automata. Acta Cybern. 8: 41-43 (1987)
19 Zoltán Ésik: Loop products and loop-free products. Acta Cybern. 8: 45-48 (1987)
18 Zoltán Ésik, Ferenc Gécseg: On a Representation of Tree Automata. Theor. Comput. Sci. 53: 243-255 (1987)
1986
17EEZoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh: Homomorphic Realizations of Automata with Compositions. MFCS 1986: 299-307
16 Zoltán Ésik: Varieties and general products of top-down algebras. Acta Cybern. 7(3): 293-298 (1986)
15 Zoltán Ésik, J. Virágh: On products of automata with identity. Acta Cybern. 7(3): 299-311 (1986)
14 Zoltán Ésik, Pál Dömösi: Complete Classes of Automata for the alpha-0-Product. Theor. Comput. Sci. 47(3): 1-14 (1986)
13 Zoltán Ésik, Ferenc Gécseg: On alpha-0-Products and alpha-2-Products. Theor. Comput. Sci. 48(3): 1-8 (1986)
1985
12 Zoltán Ésik: On the weak equivalence of Elgot's flow-chart schemata. Acta Cybern. 7(2): 147-154 (1985)
11 Stephen L. Bloom, Zoltán Ésik: Axiomatizing Schemes and Their Behaviors. J. Comput. Syst. Sci. 31(3): 375-393 (1985)
1984
10 Zoltán Ésik, Ferenc Gécseg: General products and equational classes of automata. Acta Cybern. 6: 281-284 (1984)
9 Zoltán Ésik: Decidability results concerning tree transducers II. Acta Cybern. 6: 303-314 (1984)
8 Stephen L. Bloom, Zoltán Ésik: Some varieties of iteration theories. Bulletin of the EATCS 24: 53-65 (1984)
1983
7 Zoltán Ésik: Algebras of Iteration Theories. J. Comput. Syst. Sci. 27(2): 291-303 (1983)
1981
6 Zoltán Ésik: An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration. FCT 1981: 130-136
5 Zoltán Ésik: Decidability results concerning tree transducers I. Acta Cybern. 5: 1-20 (1981)
4 Zoltán Ésik, Balázs Imreh: Remarks on finite commutative automat. Acta Cybern. 5: 143-146 (1981)
3 Zoltán Ésik, Balázs Imreh: Subdirectly irreducible commutative automata. Acta Cybern. 5: 251-260 (1981)
1979
2 Zoltán Ésik: On functional tree transducers. FCT 1979: 121-127
1976
1 Zoltán Ésik: On two problems of A. Salomaa. Acta Cybern. 2: 299-306 (1976)

Coauthor Index

1Luca Aceto [74] [84] [90] [94] [96] [113]
2L. Bernátsky [47] [49] [63]
3Michael Bertol [52] [64]
4Alberto Bertoni [120]
5Stephen L. Bloom [8] [11] [23] [28] [33] [35] [36] [37] [38] [39] [40] [41] [42] [43] [44] [46] [48] [50] [51] [53] [54] [55] [57] [59] [60] [61] [76] [81] [91] [98] [101] [104] [116] [123] [129] [130] [133] [136] [142] [143] [146]
6Janusz A. Brzozowski [78] [83] [102]
7Sinisa Crvenkovic [66] [71] [80]
8Erzsébet Csuhaj-Varjú [135]
9Igor Dolinka [66] [71] [80]
10Pál Dömösi [14] [17] [22] [25] [26] [29] [31] [79]
11Wan Fokkink [113]
12Zoltán Fülöp [106] [107] [147]
13Yuan Gao [141]
14Ferenc Gécseg [10] [13] [17] [18]
15T. Hajgató [145]
16Y. Iland [83]
17Balázs Imreh [3] [4] [29]
18Anna Ingólfsdóttir [74] [84] [90] [94] [95] [96] [99] [113]
19Masami Ito [103]
20Szabolcs Iván [134] [137] [138] [140] [144]
21Juhani Karhumäki [120]
22Werner Kuich [72] [82] [88] [97] [108] [110] [111] [114] [115] [126] [127] [129] [136] [146]
23Anna Labella [56] [61] [62] [81]
24Kim Guldstrand Larsen [100]
25Hans Leiß [93] [117]
26Guangwu Liu [128] [141]
27Ernest G. Manes [61] [81]
28Gabriela Martín [132]
29Carlos Martín-Vide [125]
30Victor Mitrana [125]
31Zoltán L. Németh [85] [109]
32Satoshi Okawa [69]
33Dirk Taubner [43]
34J. Virágh [15] [17] [20]
35Pascal Weil [105] [112] [122] [131]
36Sheng Yu [141]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)