Andrzej Ehrenfeucht
Affiliations: | University of Colorado, Boulder, Boulder, CO, United States |
Website:
http://www.cs.colorado.edu/~andrzej/Google:
"Andrzej Ehrenfeucht"Bio:
list of PhD students: http://www.cs.colorado.edu/department/publications/theses/andrzej_ehrenfeucht.html
Children
Sign in to add trainee| Eugene Wimberly Myers | grad student | 1975-1981 | CU Boulder |
| David Henry Haussler | grad student | 1982 | CU Boulder |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Ehrenfeucht A, McConnell RM, Osheim N, et al. (2011) Position heaps: A simple and dynamic text indexing data structure Journal of Discrete Algorithms. 9: 100-121 |
| Ehrenfeucht A, Rozenberg G. (2003) Forbidding-enforcing systems Theoretical Computer Science. 292: 611-638 |
| Ehrenfeucht A, Rozenberg G, Salomaa K. (1997) Semantics of nonsequential tree-based computation schemes Fundamenta Informaticae. 29: 305-324 |
| Ehrenfeucht A, Pǎun G, Rozenberg G. (1996) The linear landscape of external contextual languages Acta Informatica. 33: 571-593 |
| Ehrenfeucht A, Engelfriet J, Rozenberg G. (1996) Finite languages for the representation of finite graphs Journal of Computer and System Sciences. 52: 170-184 |
| Ehrenfeucht A, Engelfriet J, Pas Pt, et al. (1995) GRAMMATICAL CODES OF TREES AND TERMINALLY CODED GRAMMARS Fundamenta Informaticae. 23: 1-32 |
| Knill E, Ehrenfeucht A, Haussler D. (1995) The size of k-pseudotrees Discrete Mathematics. 141: 185-194 |
| Ehrenfeucht A, ten Pas P, Rozenberg G. (1994) Context-free text grammars Acta Informatica. 31: 161-206 |
| Ehrenfeucht A, Gabow HN, Mcconnell RM, et al. (1994) An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs Journal of Algorithms. 16: 283-294 |
| Ehrenfeucht A, Hoogeboom HJ, Rozenberg G. (1993) On the structure of recognizable languages of dependence graphs Rairo - Theoretical Informatics and Applications. 27: 7-22 |