Martin Kutrib

	2012
139		Martin Kutrib, Andreas Malcher, Giovanni Pighizzini: Oblivious Two-Way Finite Automata: Decidability and Complexity. LATIN 2012: 518-529
138		Markus Holzer, Sebastian Jakobi, Martin Kutrib: The Magic Number Problem for Subregular Language Families. Int. J. Found. Comput. Sci. 23(1): 115-131 (2012)
	2011
137		Markus Holzer, Martin Kutrib, Giovanni Pighizzini: Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings Springer 2011
136		Markus Holzer, Sebastian Jakobi, Martin Kutrib: The Chop of Languages. AFL 2011: 197-210
135		Markus Holzer, Martin Kutrib: Gaining Power by Input Operations: Finite Automata and Beyond. CIAA 2011: 16-29
134		Markus Holzer, Martin Kutrib, Katja Meckel: Nondeterministic State Complexity of Star-Free Languages. CIAA 2011: 178-189
133		Martin Kutrib: Nature-Based Problems in Cellular Automata. CiE 2011: 171-180
132		Markus Holzer, Martin Kutrib, Ursula Leiter: Nodes Connected by Path Languages. Developments in Language Theory 2011: 276-287
131		Martin Kutrib, Matthias Wendlandt: String Assembling Systems. NCMA 2011: 179-192
130		Markus Holzer, Andreas Klein, Martin Kutrib, Oliver Ruepp: Computational Complexity of NURIKABE. Fundam. Inform. 110(1-4): 159-174 (2011)
129		Henning Bordihn, Rudolf Freund, Mika Hirvensalo, Markus Holzer, Martin Kutrib, Friedrich Otto: Preface. Fundam. Inform. 112(2-3): (2011)
128		Henning Bordihn, Markus Holzer, Martin Kutrib: Decidability of operation problems for T0L languages and subclasses. Inf. Comput. 209(3): 344-352 (2011)
127		Markus Holzer, Martin Kutrib: Descriptional and computational complexity of finite automata - A survey. Inf. Comput. 209(3): 456-470 (2011)
126		Markus Holzer, Martin Kutrib: The Complexity of Regular(-like) Expressions. Int. J. Found. Comput. Sci. 22(7): 1533-1548 (2011)
125		Henning Bordihn, Martin Kutrib, Andreas Malcher: Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 22(7): 1577-1592 (2011)
124		Markus Holzer, Martin Kutrib, Andreas Malcher: Complexity of multi-head finite automata: Origins and directions. Theor. Comput. Sci. 412(1-2): 83-96 (2011)
123		Martin Kutrib, Andreas Malcher: Cellular automata with limited inter-cell bandwidth. Theor. Comput. Sci. 412(30): 3917-3931 (2011)
	2010
122		Henning Bordihn, Rudolf Freund, Markus Holzer, Thomas Hinze, Martin Kutrib, Friedrich Otto: Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings Austrian Computer Society 2010
121		Martin Kutrib, Jonas Lefèvre, Andreas Malcher: The Size of One-Way Cellular Automata. Automata 2010: 71-90
120		Martin Kutrib, Andreas Malcher: Two-Party Watson-Crick Computations. CIAA 2010: 191-200
119		Markus Holzer, Sebastian Jakobi, Martin Kutrib: The Magic Number Problem for Subregular Language Families DCFS 2010: 110-119
118		Markus Holzer, Martin Kutrib: The Complexity of Regular(-Like) Expressions. Developments in Language Theory 2010: 16-30
117		Henning Bordihn, Martin Kutrib, Andreas Malcher: Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Developments in Language Theory 2010: 88-99
116		Markus Holzer, Martin Kutrib: Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction. Int. Conf. on Membrane Computing 2010: 19-36
115		Martin Kutrib, Andreas Malcher: Measuring Communication in Cellular Automata. JAC 2010: 13-30
114		Martin Kutrib, Andreas Malcher: Transductions Computed by Iterative Arrays. JAC 2010: 156-167
113		Martin Kutrib, Andreas Malcher: Reversible Pushdown Automata. LATA 2010: 368-379
112		Markus Holzer, Martin Kutrib: Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata. RP 2010: 1-23
111		Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto: On stateless deterministic restarting automata. Acta Inf. 47(7-8): 391-412 (2010)
110		Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto: On Stateless Two-Pushdown Automata and Restarting Automata. Int. J. Found. Comput. Sci. 21(5): 781-798 (2010)
109		Martin Kutrib, Andreas Malcher: Cellular automata with sparse communication. Theor. Comput. Sci. 411(38-39): 3516-3526 (2010)
108		Martin Kutrib, Andreas Malcher: Real-time reversible iterative arrays. Theor. Comput. Sci. 411(4-5): 812-822 (2010)
	2009
107		Henning Bordihn, Rudolf Freund, Markus Holzer, Martin Kutrib, Friedrich Otto: Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31 - September 1, 2009. Proceedings Austrian Computer Society 2009
106		Martin Kutrib, Andreas Malcher: Cellular Automata with Sparse Communication. CIAA 2009: 34-43
105		Rudolf Freund, Andreas Klein, Martin Kutrib: On the Number of Membranes in Unary P Systems DCFS 2009: 101-109
104		Hermann Gruber, Markus Holzer, Martin Kutrib: On Measuring Non-Recursive Trade-Offs DCFS 2009: 141-150
103		Martin Kutrib, Andreas Malcher: Bounded Languages Meet Cellular Automata with Sparse Communication DCFS 2009: 163-172
102		Markus Holzer, Martin Kutrib: Descriptional and Computational Complexity of Finite Automata. LATA 2009: 23-42
101		Henning Bordihn, Markus Holzer, Martin Kutrib: Undecidability of Operation Problems for T0L Languages and Subclasses. LATA 2009: 236-246
100		Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto: On Stateless Deterministic Restarting Automata. SOFSEM 2009: 353-364
99		Martin Kutrib: Cellular Automata and Language Theory. Encyclopedia of Complexity and Systems Science 2009: 800-823
98		Martin Kutrib, Andreas Malcher: On One-way One-bit O (One)-message Cellular Automata. Electr. Notes Theor. Comput. Sci. 252: 77-91 (2009)
97		Hermann Gruber, Markus Holzer, Martin Kutrib: More on the Size of Higman-Haines Sets: Effective Constructions. Fundam. Inform. 91(1): 105-121 (2009)
96		Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib: On input-revolving deterministic and nondeterministic finite automata. Inf. Comput. 207(11): 1140-1155 (2009)
95		Markus Holzer, Martin Kutrib: Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity. Int. J. Found. Comput. Sci. 20(4): 563-580 (2009)
94		Martin Kutrib, Andreas Malcher: Computations and Decidability of Iterative Arrays with Restricted Communication. Parallel Processing Letters 19(2): 247-264 (2009)
93		Henning Bordihn, Markus Holzer, Martin Kutrib: Determination of finite automata accepting subregular languages. Theor. Comput. Sci. 410(35): 3209-3222 (2009)
92		Martin Kutrib, Andreas Malcher, Larissa Werlein: Regulated nondeterminism in pushdown automata. Theor. Comput. Sci. 410(37): 3447-3460 (2009)
	2008
91		Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto: On Stateless Two-Pushdown Automata and Restarting Automata. AFL 2008: 257-268
90		Martin Kutrib, Andreas Malcher: Real-time reversible language recognition by cellular automata. Automata 2008: 208-221
89		Markus Holzer, Martin Kutrib: Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. CIAA 2008: 1-16
88		Markus Holzer, Martin Kutrib, Andreas Malcher: Multi-Head Finite Automata: Characterizations, Concepts and Open Problems CSP 2008: 93-107
87		Henning Bordihn, Markus Holzer, Martin Kutrib: State Complexity of NFA to DFA Conversion of Subregular Language Families. DCFS 2008: 85-96
86		Henning Bordihn, Martin Kutrib, Andreas Malcher: On the Computational Capacity of Parallel Communicating Finite Automata. Developments in Language Theory 2008: 146-157
85		Suna Bensch, Henning Bordihn, Markus Holzer, Martin Kutrib: Deterministic Input-Reversal and Input-Revolving Finite Automata. LATA 2008: 113-124
84		Martin Kutrib: Cellular Automata - A Computational Point of View. New Developments in Formal Languages and Applications 2008: 183-227
83		Martin Kutrib, Andreas Malcher, Detlef Wotschke: The Boolean closure of linear context-free languages. Acta Inf. 45(3): 177-191 (2008)
82		Martin Kutrib, Andreas Malcher: Fast reversible language recognition using cellular automata. Inf. Comput. 206(9-10): 1142-1151 (2008)
81		Martin Kutrib, Jens Reimann: Succinct description of regular languages by weak restarting automata. Inf. Comput. 206(9-10): 1152-1160 (2008)
80		Martin Kutrib, Jens Reimann: Optimal Simulations of Weak Restarting Automata. Int. J. Found. Comput. Sci. 19(4): 795-811 (2008)
79		Martin Kutrib: Efficient Pushdown Cellular Automata: Universality, Time and Space Hierarchies. J. Cellular Automata 3(2): 93-114 (2008)
	2007
78		Martin Kutrib, Andreas Malcher, Larissa Werlein: Regulated Nondeterminism in Pushdown Automata. CIAA 2007: 85-96
77		Martin Kutrib, Jens Reimann: Optimal Simulations of Weak Restarting Automata. DCFS 2007: 81-92
76		Henning Bordihn, Markus Holzer, Martin Kutrib: Hairpin Finite Automata. Developments in Language Theory 2007: 108-119
75		Martin Kutrib, Andreas Malcher: Real-Time Reversible Iterative Arrays. FCT 2007: 376-387
74		Martin Kutrib, Andreas Malcher: Fast Reversible Language Recognition Using Cellular Automata. LATA 2007: 331-342
73		Martin Kutrib, Jens Reimann: Succinct Description of Regular Languages by Weak Restarting Automata. LATA 2007: 343-354
72		Hermann Gruber, Markus Holzer, Martin Kutrib: More on the Size of Higman-Haines Sets: Effective Constructions. MCU 2007: 193-204
71		Martin Kutrib, Andreas Malcher: Finite turns and the regular closure of linear context-free languages. Discrete Applied Mathematics 155(16): 2152-2164 (2007)
70		Andreas Klein, Martin Kutrib: Cellular Devices and Unary Languages. Fundam. Inform. 78(3): 343-368 (2007)
69		Henning Bordihn, Markus Holzer, Martin Kutrib: Hybrid Extended Finite Automata. Int. J. Found. Comput. Sci. 18(4): 745-760 (2007)
68		Andreas Klein, Martin Kutrib: Context-Free Grammars with Linked Nonterminals. Int. J. Found. Comput. Sci. 18(6): 1271-1282 (2007)
67		Martin Kutrib, Andreas Malcher: When Church-Rosser Becomes Context Free. Int. J. Found. Comput. Sci. 18(6): 1293-1302 (2007)
66		Markus Holzer, Martin Kutrib, Jens Reimann: Non-Recursive Trade-Offs for Deterministic Restarting Automata. Journal of Automata, Languages and Combinatorics 12(1-2): 195-213 (2007)
65		Martin Kutrib, Andreas Malcher: Context-dependent nondeterminism for pushdown automata. Theor. Comput. Sci. 376(1-2): 101-111 (2007)
64		Hermann Gruber, Markus Holzer, Martin Kutrib: The size of Higman-Haines sets. Theor. Comput. Sci. 387(2): 167-176 (2007)
	2006
63		Henning Bordihn, Markus Holzer, Martin Kutrib: Hybrid Extended Finite Automata. CIAA 2006: 34-45
62		Markus Holzer, Martin Kutrib: The Size of Higman-Haines Sets. DCFS 2006: 177-187
61		Martin Kutrib, Andreas Malcher: Context-Dependent Nondeterminism for Pushdown Automata. Developments in Language Theory 2006: 133-144
60		Martin Kutrib, Andreas Malcher: Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity. IFIP TCS 2006: 151-164
59		Martin Kutrib, Andreas Malcher: Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability. MFCS 2006: 634-645
58		Markus Holzer, Martin Kutrib: Variable Complexity of Simple Programs. Fundam. Inform. 74(4): 511-528 (2006)
	2005
57		Markus Holzer, Martin Kutrib, Jens Reimann: Descriptional Complexity of Deterministic Restarting Automata. DCFS 2005: 158-169
56		Henning Bordihn, Markus Holzer, Martin Kutrib: Revolving-Input Finite Automata. Developments in Language Theory 2005: 168-179
55		Henning Bordihn, Markus Holzer, Martin Kutrib: Unsolvability levels of operation problems for subclasses of context-free languages. Int. J. Found. Comput. Sci. 16(3): 423-440 (2005)
54		Martin Kutrib: The phenomenon of non-recursive trade-offs. Int. J. Found. Comput. Sci. 16(5): 957-973 (2005)
53		Markus Holzer, Martin Kutrib: On the descriptional complexity of finite automata with modified acceptance conditions. Theor. Comput. Sci. 330(2): 267-285 (2005)
52		Martin Kutrib: On the descriptional power of heads, counters, and pebbles. Theor. Comput. Sci. 330(2): 311-324 (2005)
	2004
51		Henning Bordihn, Markus Holzer, Martin Kutrib: Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. CIAA 2004: 68-79
50		Martin Kutrib: The Phenomenon of Non-Recursive Trade-Offs. DCFS 2004: 83-97
49		Henning Bordihn, Markus Holzer, Martin Kutrib: Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages. Developments in Language Theory 2004: 102-113
48		Martin Kutrib, Andreas Malcher, Detlef Wotschke: The Boolean Closure of Linear Context-Free Languages. Developments in Language Theory 2004: 284-295
47		Markus Holzer, Martin Kutrib: Register Complexity of LOOP-, WHILE-, and GOTO-Programs. MCU 2004: 233-244
46		Martin Kutrib, Maurice Margenstern, Hiroshi Umeo: Foreword. IEICE Transactions 87-D(3): 647-649 (2004)
45		Björn Fay, Martin Kutrib: The Fault-Tolerant Early Bird Problem. IEICE Transactions 87-D(3): 687-693 (2004)
44		Henning Bordihn, Markus Holzer, Martin Kutrib: Economy of Description for Basic Constructions on Rational Transductions. Journal of Automata, Languages and Combinatorics 9(2/3): 175-188 (2004)
	2003
43		Martin Kutrib: On the Descriptional Power of Heads, Counters, and Pebbles. DCFS 2003: 138-149
42		Markus Holzer, Martin Kutrib: Flip-Pushdown Automata: Nondeterminism Is Better than Determinism. Developments in Language Theory 2003: 361-372
41		Martin Kutrib: Dimension- and Time-Hierarchies for Small Time Bounds. FCT 2003: 321-332
40		Markus Holzer, Martin Kutrib: Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k. ICALP 2003: 490-501
39		Martin Kutrib, Maurice Margenstern, Hiroshi Umeo: Foreword. Fundam. Inform. 58(2003): (2003)
38		Martin Kutrib, Jan-Thomas Löwe: Space- and Time-Bounded Nondeterminism for Cellular Automata. Fundam. Inform. 58(2003): 273-293 (2003)
37		Markus Holzer, Martin Kutrib: Nondeterministic Descriptional Complexity Of Regular Languages. Int. J. Found. Comput. Sci. 14(6): 1087-1102 (2003)
36		Andreas Klein, Martin Kutrib: Fast one-way cellular automata. Theor. Comput. Sci. 295: 233-250 (2003)
	2002
35		Markus Holzer, Martin Kutrib: State Complexity of Basic Operations on Nondeterministic Finite Automata. CIAA 2002: 148-157
34		Andreas Klein, Martin Kutrib: Self-Assembling Finite Automata. COCOON 2002: 310-319
33		Henning Bordihn, Markus Holzer, Martin Kutrib: Economy of Descriptions for Basic Constructions on Rational Transductions. DCFS 2002: 55-69
32		Markus Holzer, Martin Kutrib: Unary Language Operations and Their Nondeterministic State Complexity. Developments in Language Theory 2002: 162-172
31		Martin Kutrib, Jan-Thomas Löwe: String Transformation for n -Dimensional Image Compression. SOFSEM 2002: 208-217
30		Thomas Buchholz, Andreas Klein, Martin Kutrib: On Interacting Automata with Limited Nondeterminism. Fundam. Inform. 52(1-3): 15-38 (2002)
29		Martin Kutrib, Jan-Thomas Löwe: Massively parallel fault tolerant computations on syntactical patterns. Future Generation Comp. Syst. 18(7): 905-919 (2002)
28		Martin Kutrib: Refining Nondeterminism Below Linear Time. Journal of Automata, Languages and Combinatorics 7(4): 533-547 (2002)
27		Andreas Klein, Martin Kutrib: Deterministic Turing machines in the range between real-time and linear-time. Theor. Comput. Sci. 289(1): 253-275 (2002)
	2001
26		Markus Holzer, Martin Kutrib: Improving Raster Image Run-Length Encoding Using Data Order. CIAA 2001: 161-176
25		Martin Kutrib: Refining Nondeterminism below Linear-Time. DCFS 2001: 103-114
24		Martin Kutrib: Efficient Universal Pushdown Cellular Automata and Their Application to Complexity. MCU 2001: 252-263
23		Andreas Klein, Martin Kutrib: A Time Hierarchy for Bounded One-Way Cellular Automata. MFCS 2001: 439-450
22		Martin Kutrib: Automata arrays and context-free languages. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 139-148
	2000
21		Martin Kutrib, Jan-Thomas Löwe: Fault Tolerant Parallel Pattern Recognition. ACRI 2000: 72-80
20		Thomas Buchholz, Andreas Klein, Martin Kutrib: Real-Time Language Recognition by Alternating Cellular Automata. IFIP TCS 2000: 213-225
19		Thomas Buchholz, Andreas Klein, Martin Kutrib: Iterative Arrays with Small Time Bounds. MFCS 2000: 243-252
18		Martin Kutrib, Jan-Thomas Löwe: Massively Parallel Pattern Recognition with Link Failures. SOFSEM 2000: 392-401
17		Thomas Buchholz, Andreas Klein, Martin Kutrib: Iterative Arrays With Limited Nondeterministic Communication Cell. Words, Languages & Combinatorics 2000: 73-87
16		Andreas Klein, Martin Kutrib: Deterministic Turing Machines in the Range between Real-Time and Linear-Time Electronic Colloquium on Computational Complexity (ECCC) 7(75): (2000)
	1999
15		Thomas Buchholz, Andreas Klein, Martin Kutrib: On tally languages and generalized interacting automata. Developments in Language Theory 1999: 316-325
14		Thomas Buchholz, Andreas Klein, Martin Kutrib: Iterative Arrays with a Wee Bit Alternation. FCT 1999: 173-184
13		Thomas Buchholz, Andreas Klein, Martin Kutrib: On time reduction and simulation in cellular spaces. Int. J. Comput. Math. 71(4): 459-474 (1999)
12		Martin Kutrib: Pushdown Cellular Automata. Theor. Comput. Sci. 215(1-2): 239-261 (1999)
	1998
11		Thomas Buchholz, Andreas Klein, Martin Kutrib: One Guess One-Way Cellular Arrays. MFCS 1998: 807-815
10		Thomas Buchholz, Martin Kutrib: On Time Computability of Functions in One-Way Cellular Automata. Acta Inf. 35(4): 329-352 (1998)
	1997
9		Thomas Buchholz, Martin Kutrib: On the power of one-way bounded cellular time computers. Developments in Language Theory 1997: 365-375
8		Martin Kutrib, Roland Vollmar, Thomas Worsch: Introduction to the Special Issue on Cellular Automata. Parallel Computing 23(11): 1567-1576 (1997)
7		Thomas Buchholz, Martin Kutrib: Some Relations Between Massively Parallel Arrays. Parallel Computing 23(11): 1643-1662 (1997)
	1996
6		Alf-Christian Achilles, Martin Kutrib, Thomas Worsch: On Relations between Arrays of Processing Elements of Different Dimensionality. Parcella 1996: 13-20
	1995
5		Martin Kutrib, Jörg Richstein: Real-Time One-Way Pushdown Cellular Automata Languages. Developments in Language Theory 1995: 420-429
4		Martin Kutrib, Roland Vollmar: The Firing Squad Synchronization Problem in Defective Cellular Automata. IEICE Transactions 78-D(7): 895-900 (1995)
	1994
3		Martin Kutrib, Thomas Worsch: Investigation of Different Input Modes for Cellular Automata. Parcella 1994: 141-150
	1993
2		Martin Kutrib: Kellererweiterte Polyautomaten. Universität Giessen 1993: 1-151
	1991
1		Martin Kutrib, Roland Vollmar: Minimal Time Synchronization in Restricted Defective Cellular Automata. Elektronische Informationsverarbeitung und Kybernetik 27(3): 179-196 (1991)

Coauthor Index

1	Alf-Christian Achilles	[6]
2	Suna Bensch (Suna Aydin)	[85] [96]
3	Henning Bordihn	[33] [44] [49] [51] [55] [56] [63] [69] [76] [85] [86] [87] [93] [96] [101] [107] [117] [122] [125] [128] [129]
4	Thomas Buchholz	[7] [9] [10] [11] [13] [14] [15] [17] [19] [20] [30]
5	Björn Fay	[45]
6	Rudolf Freund	[105] [107] [122] [129]
7	Hermann Gruber	[64] [72] [97] [104]
8	Thomas Hinze	[122]
9	Mika Hirvensalo	[129]
10	Markus Holzer	[26] [32] [33] [35] [37] [40] [42] [44] [47] [49] [51] [53] [55] [56] [57] [58] [62] [63] [64] [66] [69] [72] [76] [85] [87] [88] [89] [93] [95] [96] [97] [101] [102] [104] [107] [112] [116] [118] [119] [122] [124] [126] [127] [128] [129] [130] [132] [134] [135] [136] [137] [138]
11	Sebastian Jakobi	[119] [136] [138]
12	Andreas Klein	[11] [13] [14] [15] [16] [17] [19] [20] [23] [27] [30] [34] [36] [68] [70] [105] [130]
13	Jonas Lefèvre	[121]
14	Ursula Leiter	[132]
15	Jan-Thomas Löwe	[18] [21] [29] [31] [38]
16	Andreas Malcher	[48] [59] [60] [61] [65] [67] [71] [74] [75] [78] [82] [83] [86] [88] [90] [92] [94] [98] [103] [106] [108] [109] [113] [114] [115] [117] [120] [121] [123] [124] [125] [139]
17	Maurice Margenstern	[39] [46]
18	Katja Meckel	[134]
19	Hartmut Messerschmidt	[91] [100] [110] [111]
20	Friedrich Otto	[91] [100] [107] [110] [111] [122] [129]
21	Giovanni Pighizzini	[137] [139]
22	Jens Reimann	[57] [66] [73] [77] [80] [81]
23	Jörg Richstein	[5]
24	Oliver Ruepp	[130]
25	Hiroshi Umeo	[39] [46]
26	Roland Vollmar	[1] [4] [8]
27	Matthias Wendlandt	[131]
28	Larissa Werlein	[78] [92]
29	Thomas Worsch	[3] [6] [8]
30	Detlef Wotschke	[48] [83]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page