Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDKai Salomaa
Person information
- affiliation: Queen's University, Kingston, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j132]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Consensus string problem for multiple regular languages. Inf. Comput. 279: 104615 (2021)- [j131]Sang-Ki Ko, Yo-Sub Han, Kai Salomaa:
Generalizations of Code Languages with Marginal Errors. Int. J. Found. Comput. Sci. 32(5): 509-529 (2021) - [j130]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Closest substring problems for regular languages. Theor. Comput. Sci. 862: 144-154 (2021) - [j129]Taylor J. Smith
, Kai Salomaa:
Decision problems and projection languages for restricted variants of two-dimensional automata. Theor. Comput. Sci. 870: 153-164 (2021) - [c126]Taylor J. Smith, Kai Salomaa:
Concatenation Operations and Restricted Variants of Two-Dimensional Automata. SOFSEM 2021: 147-158 - [c125]Taylor J. Smith, Kai Salomaa:
Degrees of Restriction for Two-Dimensional Automata. CIAA 2021: 77-89 - [i7]Taylor J. Smith, Kai Salomaa:
Degrees of Restriction for Two-Dimensional Automata. CoRR abs/2105.01179 (2021) - 2020
- [c124]Chris Keeler, Kai Salomaa:
Combining Limited Parallelism and Nondeterminism in Alternating Finite Automata. DCFS 2020: 91-103 - [c123]Taylor J. Smith, Kai Salomaa:
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata. DCFS 2020: 206-218 - [c122]Chris Keeler, Kai Salomaa:
Alternating Finite Automata with Limited Universal Branching. LATA 2020: 196-207 - [i6]Taylor J. Smith, Kai Salomaa:
Concatenation Operations and Restricted Variants of Two-Dimensional Automata. CoRR abs/2008.11164 (2020) - [i5]Taylor J. Smith, Kai Salomaa:
Recognition and Complexity Results for Projection Languages of Two-Dimensional Automata. CoRR abs/2009.00602 (2020)
2010 – 2019
- 2019
- [j128]Chris Keeler, Kai Salomaa:
Branching Measures and Nearly Acyclic NFAs. Int. J. Found. Comput. Sci. 30(6-7): 1135-1155 (2019) - [j127]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Suffix Distance. Int. J. Found. Comput. Sci. 30(6-7): 1197-1216 (2019) - [j126]Alexander Okhotin, Kai Salomaa:
State Complexity of the Quotient Operation on Input-Driven Pushdown Automata. Int. J. Found. Comput. Sci. 30(6-7): 1217-1235 (2019) - [j125]Nafiul Rashid, Salimur Choudhury, Kai Salomaa:
Localized algorithms for redundant readers elimination in RFID networks. Int. J. Parallel Emergent Distributed Syst. 34(3): 260-271 (2019) - [j124]Alexander Okhotin, Kai Salomaa:
Edit distance neighbourhoods of input-driven pushdown automata. Theor. Comput. Sci. 777: 417-430 (2019) - [j123]Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith:
Site-directed insertion: Language equations and decision problems. Theor. Comput. Sci. 798: 40-51 (2019) - [j122]Alexander Okhotin, Kai Salomaa:
Further closure properties of input-driven pushdown automata. Theor. Comput. Sci. 798: 65-77 (2019) - [j121]Fabio Campioni, Salimur Choudhury, Kai Salomaa, Selim G. Akl:
Improved Recruitment Algorithms for Vehicular Crowdsensing Networks. IEEE Trans. Veh. Technol. 68(2): 1198-1207 (2019) - [c121]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Limited Nondeterminism of Input-Driven Pushdown Automata: Decidability and Complexity. DCFS 2019: 158-170 - [c120]Chris Keeler, Kai Salomaa:
Nondeterminism Growth and State Complexity. DCFS 2019: 210-222 - [c119]Hyunjoon Cheon, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
The Relative Edit-Distance Between Two Input-Driven Languages. DLT 2019: 127-139 - [c118]Taylor J. Smith, Kai Salomaa:
Decision Problems for Restricted Variants of Two-Dimensional Automata. CIAA 2019: 222-234 - [i4]Taylor J. Smith, Kai Salomaa:
Decision Problems for Restricted Variants of Two-Dimensional Automata. CoRR abs/1904.11100 (2019) - 2018
- [j120]Bahram Kouhestani, David Rappaport, Kai Salomaa:
Routing in a polygonal terrain with the shortest beacon watchtower. Comput. Geom. 68: 34-47 (2018) - [j119]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Neighbourhoods and Approximate Pattern Matching. Int. J. Found. Comput. Sci. 29(2): 315-329 (2018) - [j118]Alexandros Palioudakis, Yo-Sub Han, Kai Salomaa:
Growth Rate of Minimum Branching. J. Autom. Lang. Comb. 23(1-3): 281-292 (2018) - [c117]Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith:
Site-Directed Insertion: Decision Problems, Maximality and Minimality. DCFS 2018: 49-61 - [c116]Chris Keeler, Kai Salomaa:
Cycle Height of Finite Automata. DCFS 2018: 200-211 - [c115]Alexander Okhotin, Kai Salomaa:
Further Closure Properties of Input-Driven Pushdown Automata. DCFS 2018: 224-236 - [c114]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Kai Salomaa:
Site-Directed Deletion. DLT 2018: 219-230 - [c113]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Closest Substring Problems for Regular Languages. DLT 2018: 392-403 - [i3]Da-Jung Cho, Yo-Sub Han, Kai Salomaa, Taylor J. Smith:
Site-Directed Insertion: Decision Problems, Maximality and Minimality. CoRR abs/1804.11017 (2018) - 2017
- [j117]Yo-Sub Han, Arto Salomaa, Kai Salomaa:
Ambiguity, Nondeterminism and State Complexity of Finite Automata. Acta Cybern. 23(1): 141-157 (2017) - [j116]Kai Salomaa, Andrew L. Szilard:
Report on the Magic in Science symposium. Bull. EATCS 123 (2017) - [j115]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
State Complexity of k-Parallel Tree Concatenation. Fundam. Informaticae 154(1-4): 185-199 (2017) - [j114]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Worst Case Branching and Other Measures of Nondeterminism. Int. J. Found. Comput. Sci. 28(3): 195-210 (2017) - [j113]Yo-Sub Han, Kai Salomaa:
Preface. Int. J. Found. Comput. Sci. 28(5): 437-440 (2017) - [j112]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Prefix Distance of Subregular Languages. J. Autom. Lang. Comb. 22(1-3): 169-188 (2017) - [j111]Alexander Okhotin, Kai Salomaa:
State complexity of operations on input-driven pushdown automata. J. Comput. Syst. Sci. 86: 207-228 (2017) - [j110]Timothy Ng, David Rappaport, Kai Salomaa:
State complexity of prefix distance. Theor. Comput. Sci. 679: 107-117 (2017) - [j109]Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Alexandros Palioudakis, Kai Salomaa:
State complexity of permutation on finite languages over a binary alphabet. Theor. Comput. Sci. 682: 67-78 (2017) - [j108]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Pseudoknot-generating operation. Theor. Comput. Sci. 696: 52-64 (2017) - [j107]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Outfix-guided insertion. Theor. Comput. Sci. 701: 70-84 (2017) - [c112]Timothy Ng, David Rappaport, Kai Salomaa:
Quasi-Distances and Weighted Finite Automata. The Role of Theory in Computer Science 2017: 135-152 - [c111]Alexander Okhotin, Kai Salomaa:
Edit Distance Neighbourhoods of Input-Driven Pushdown Automata. CSR 2017: 260-272 - [c110]Chris Keeler, Kai Salomaa:
Branching Measures and Nearly Acyclic NFAs. DCFS 2017: 202-213 - [c109]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Suffix Distance. DCFS 2017: 287-298 - [c108]Alexander Okhotin, Kai Salomaa:
The Quotient Operation on Input-Driven Pushdown Automata. DCFS 2017: 299-310 - [c107]Timothy Ng, David Rappaport, Kai Salomaa:
Relative Prefix Distance Between Languages. DLT 2017: 284-295 - [c106]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
Consensus String Problem for Multiple Regular Languages. LATA 2017: 196-207 - [i2]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Outfix-guided insertion. CoRR abs/1707.04651 (2017) - 2016
- [j106]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
State complexity of deletion and bipolar deletion. Acta Informatica 53(1): 67-85 (2016) - [j105]Sang-Ki Ko, Yo-Sub Han, Kai Salomaa:
Approximate matching between a context-free grammar and a finite-state automaton. Inf. Comput. 247: 278-289 (2016) - [j104]Yo-Sub Han, Sang-Ki Ko, Timothy Ng, Kai Salomaa:
State Complexity of Insertion. Int. J. Found. Comput. Sci. 27(7): 863-878 (2016) - [j103]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa:
Duplications and Pseudo-Duplications. Int. J. Unconv. Comput. 12(2-3): 145-167 (2016) - [j102]Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko, Kai Salomaa:
Pseudo-inversion: closure properties and decidability. Nat. Comput. 15(1): 31-39 (2016) - [j101]Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
State complexity of inversion operations. Theor. Comput. Sci. 610: 2-12 (2016) - [j100]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Operational state complexity of unary NFAs with finite nondeterminism. Theor. Comput. Sci. 610: 108-120 (2016) - [c105]Bahram Kouhestani, David Rappaport, Kai Salomaa:
The Length of the Beacon Attraction Trajectory. CCCG 2016: 69-74 - [c104]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Prefix Distance of Subregular Languages. DCFS 2016: 192-204 - [c103]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Outfix-Guided Insertion - (Extended Abstract). DLT 2016: 102-113 - [c102]Nafiul Rashid, Salimur Choudhury, Kai Salomaa:
CARRE: Cellular automaton based redundant readers elimination in RFID networks. ICC 2016: 1-6 - [c101]Da-Jung Cho, Yo-Sub Han, Timothy Ng, Kai Salomaa:
Pseudoknot-Generating Operation. SOFSEM 2016: 241-252 - [e3]Yo-Sub Han, Kai Salomaa:
Implementation and Application of Automata - 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings. Lecture Notes in Computer Science 9705, Springer 2016, ISBN 978-3-319-40945-0 [contents] - 2015
- [j99]Yo-Sub Han, Sang-Ki Ko, Xiaoxue Piao, Kai Salomaa:
State Complexity of Kleene-Star Operations on Regular Tree Languages. Acta Cybern. 22(2): 403-422 (2015) - [j98]Hae-Sung Eom, Yo-Sub Han, Kai Salomaa:
State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. Int. J. Found. Comput. Sci. 26(2): 211-228 (2015) - [j97]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Unary NFAs, Limited Nondeterminism, and Chrobak Normal Form. Int. J. Unconv. Comput. 11(5-6): 395-416 (2015) - [j96]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
Cellular Automaton Based Localized Algorithms for Mobile Sensor Networks. Int. J. Unconv. Comput. 11(5-6): 417-447 (2015) - [j95]Alexander Okhotin, Kai Salomaa:
Descriptional complexity of unambiguous input-driven pushdown automata. Theor. Comput. Sci. 566: 1-11 (2015) - [c100]Bahram Kouhestani, David Rappaport, Kai Salomaa:
On the Inverse Beacon Attraction Region of a Point. CCCG 2015 - [c99]Cezar Câmpeanu, Kai Salomaa:
Nondeterministic Tree Width of Regular Languages. DCFS 2015: 46-57 - [c98]Timothy Ng, David Rappaport, Kai Salomaa:
Quasi-Distances and Weighted Finite Automata. DCFS 2015: 209-219 - [c97]Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
The State Complexity of Permutations on Finite Languages over Binary Alphabets. DCFS 2015: 220-230 - [c96]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Generalizations of Code Languages with Marginal Errors. DLT 2015: 264-275 - [c95]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Neighbourhoods and Approximate Pattern Matching. DLT 2015: 389-400 - [c94]Da-Jung Cho, Yo-Sub Han, Hwee Kim, Alexandros Palioudakis, Kai Salomaa:
Duplications and Pseudo-Duplications. UCNC 2015: 157-168 - [c93]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
Cellular automata and object monitoring in mobile wireless sensor networks. WCNC 2015: 1344-1349 - [c92]Timothy Ng, David Rappaport, Kai Salomaa:
State Complexity of Prefix Distance. CIAA 2015: 238-249 - 2014
- [j94]Daniel Goc, Alexandros Palioudakis, Kai Salomaa:
Nondeterministic State Complexity of Proportional Removals. Int. J. Found. Comput. Sci. 25(7): 823-836 (2014) - [j93]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Lower Bound for Converting an NFA with Finite Nondeterminism into an MDFA. J. Autom. Lang. Comb. 19(1-4): 251-264 (2014) - [j92]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
Cellular automaton-based algorithms for the dispersion of mobile wireless sensor networks. Int. J. Parallel Emergent Distributed Syst. 29(2): 147-177 (2014) - [j91]Alexander Okhotin, Kai Salomaa:
Complexity of input-driven pushdown automata. SIGACT News 45(2): 47-67 (2014) - [c91]Hae-Sung Eom, Yo-Sub Han, Kai Salomaa, Sheng Yu:
State Complexity of Combined Operations for Prefix-Free Regular Languages. Discrete Mathematics and Computer Science 2014: 137-151 - [c90]Bahram Kouhestani, David Rappaport, Kai Salomaa:
Routing in a Polygonal Terrain with the Shortest Beacon Watchtower. CCCG 2014 - [c89]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
Cellular automata and Mobile Wireless Sensor Networks. CCECE 2014: 1-5 - [c88]Da-Jung Cho, Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
State Complexity of Inversion Operations. DCFS 2014: 102-113 - [c87]Daniel Goc, Kai Salomaa:
Computation Width and Deviation Number. DCFS 2014: 150-161 - [c86]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
State Complexity of Unary Language Operations for NFAs with Limited Nondeterminism. DCFS 2014: 330-341 - [c85]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
State Complexity of Deletion. Developments in Language Theory 2014: 37-48 - [c84]Alexander Okhotin, Kai Salomaa:
Input-Driven Pushdown Automata with Limited Nondeterminism - (Invited Paper). Developments in Language Theory 2014: 84-102 - [c83]Sang-Ki Ko, Yo-Sub Han, Kai Salomaa:
Top-Down Tree Edit-Distance of Regular Tree Languages. LATA 2014: 466-477 - [c82]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Unary NFAs with Limited Nondeterminism. SOFSEM 2014: 443-454 - [c81]Da-Jung Cho, Yo-Sub Han, Shin-Dong Kang, Hwee Kim, Sang-Ki Ko, Kai Salomaa:
Pseudo-inversion on Formal Languages. UCNC 2014: 93-104 - 2013
- [j90]Arto Salomaa, Kai Salomaa, Sheng Yu:
Undecidability of state complexity. Int. J. Comput. Math. 90(6): 1310-1320 (2013) - [j89]Arto Salomaa, Kai Salomaa, Andrew L. Szilard:
Goodby to the Kindhearted Dragon Prof. Sheng Yu, 1950-2012. Int. J. Found. Comput. Sci. 24(7): 945-954 (2013) - [j88]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
The Edit-Distance between a Regular Language and a Context-Free Language. Int. J. Found. Comput. Sci. 24(7): 1067-1082 (2013) - [c80]Hae-Sung Eom, Yo-Sub Han, Kai Salomaa:
State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. DCFS 2013: 78-89 - [c79]Daniel Goc, Alexandros Palioudakis, Kai Salomaa:
Nondeterministic State Complexity of Proportional Removals. DCFS 2013: 102-111 - [c78]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Comparisons between Measures of Nondeterminism on Finite Automata. DCFS 2013: 217-228 - [c77]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
Finite Nondeterminism vs. DFAs with Multiple Initial States. DCFS 2013: 229-240 - [c76]Alexander Okhotin, Kai Salomaa:
Input-driven pushdown automata: nondeterminism and unambiguity. NCMA 2013: 31-33 - [c75]Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton. CIAA 2013: 146-157 - 2012
- [j87]Arto Salomaa, Kai Salomaa, Andrew L. Szilard:
Sheng Yu (1950-2012) In Memoriam. Fundam. Informaticae 120(1): 71-74 (2012) - [j86]Cristian S. Calude, Kai Salomaa, Tania Roblot:
State-Size Hierarchy for Finite-State Complexity. Int. J. Found. Comput. Sci. 23(1): 37-50 (2012) - [j85]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
State Complexity of Finite Tree Width NFAs. J. Autom. Lang. Comb. 17(2-4): 245-264 (2012) - [j84]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
A Cellular Automaton Model for Wireless Sensor Networks. J. Cell. Autom. 7(3): 223-241 (2012) - [j83]David Sears, Kai Salomaa:
Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes. Nat. Comput. 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) - [c74]Alexander Okhotin, Xiaoxue Piao, Kai Salomaa:
Descriptional Complexity of Input-Driven Pushdown Automata. Languages Alive 2012: 186-206 - [c73]Xiaoxue Piao, Kai Salomaa:
State Complexity of Kleene-Star Operations on Trees. Computation, Physics and Beyond 2012: 388-402 - [c72]Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
State Complexity and Limited Nondeterminism. DCFS 2012: 252-265 - [c71]Xiaoxue Piao, Kai Salomaa:
State Complexity of Projection and Quotient on Unranked Trees. DCFS 2012: 280-293 - [c70]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 - [c69]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
A cellular automaton model for connectivity preserving deployment of mobile wireless sensors. ICC 2012: 6545-6549 - [c68]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
Cellular automaton based algorithms for depth adjustment in underwater mobile sensor networks. MASS Workshops 2012: 1-6 - [c67]Salimur Choudhury, Kai Salomaa, Selim G. Akl:
Cellular Automaton Based Motion Planning Algorithms for Mobile Sensor Networks. TPNC 2012: 108-120 - [c66]Salimur Choudhury, Selim G. Akl, Kai Salomaa:
Energy efficient cellular automaton based algorithms for mobile wireless sensor networks. WCNC 2012: 2341-2346 - [c65]Yuan Gao, Kai Salomaa:
In Memoriam Sheng Yu. CIAA 2012: 1-4 - 2011
- [j80]Xiaoxue Piao, Kai Salomaa:
Transformations Between Different Models of Unranked Bottom-Up Tree Automata. Fundam. Informaticae 109(4): 405-424 (2011) - [j79]Yuan Gao, Kai Salomaa, Sheng Yu:
Transition Complexity of Incomplete DFAs. Fundam. Informaticae 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]Michael Domaratzki, Kai Salomaa:
Preface. Int. J. Found. Comput. Sci. 22(8) (2011) - [j75]Erzsébet Csuhaj-Varjú, Kai Salomaa:
Editorial: Computing with biomolecules. Nat. Comput. 10(2): 775-776 (2011) - [j74]Cristian S. Calude, Kai Salomaa, Tania Roblot:
Finite state complexity. Theor. Comput. Sci. 412(41): 5668-5677 (2011) - [c64]Xiaoxue Piao, Kai Salomaa, Sándor Vágvölgyi:
Tree Homomorphisms for Unranked Trees. AFL 2011: 343-357 - [c63]Michael Domaratzki, Kai Salomaa:
On Language Decompositions and Primality. Rainbow of Computer Science 2011: 63-75 - [c62]Xiaoxue Piao, Kai Salomaa:
State Trade-Offs in Unranked Tree Automata. DCFS 2011: 261-274 - [c61]Alexander Okhotin, Kai Salomaa:
Descriptional Complexity of Unambiguous Nested Word Automata. LATA 2011: 414-426 - [c60]Arto Salomaa, Kai Salomaa, Sheng Yu:
Undecidability of the State Complexity of Composed Regular Operations. LATA 2011: 489-498 - [c59]