The Third Homomorphism Theorem on Trees : Downward & Upward Lead to Divide-and-Conquer
- Author
- MORIHATA, Akimasa1 ; MATSUZAKI, Kiminori1 ; ZHENJIANG HU2 ; TAKEICHI, Masato1
[1] University of Tokyo, Japan
[2] National Institute of Informatics, Japan - Conference title
- Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
- Conference name
- Symposium on Principles of Programming Languages (36 ; Savannah, Georgia 2009-01-23)
- Author (monograph)
- PIERCE, Benjamin C (Editor)1
[1] University of Pennsylvania, United States - Source
ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 177-185, 9 p ; ref : 3/4 p
- ISSN
- 1523-2867
- Scientific domain
- Computer science
- Publisher
- Association for Computing Machinery, New York, NY
- Publication country
- United States
- Document type
- Conference Paper
- Language
- English
- Author keyword
- Algorithm Huet's zippers Polynomial data structures The third homomorphism theorem Theory; Divide-and-conquer
- Keyword (fr)
- Arborescence Développement logiciel Extensibilité Homomorphisme Langage programmation Méthode diviser pour régner Parallélisation automatique Programme parallèle Structure donnée
- Keyword (en)
- Treeing Software development Scalability Homomorphism Programming language Divide and conquer method Automatic parallelization Parallel program Data structure
- Keyword (es)
- Arborescencia Desarrollo logicial Estensibilidad Homomorfismo Lenguaje programación Método dividir para vencer Paralelización automática Programa paralelo Estructura datos
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B02 Programming languages
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B04 Computer systems and distributed systems. User interface
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 21327080
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Install on your browser
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:86:\"The Third Homomorphism Theorem on Trees : Downward & Upward Lead to Divide-and-Conquer\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:3:\"177\";s:8:\"\u0000*\u0000epage\";s:3:\"185\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"MORIHATA\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Akimasa\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:19:\"MATSUZAKI, Kiminori\";i:1;s:12:\"ZHENJIANG HU\";i:2;s:16:\"TAKEICHI, Masato\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:98:\"Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages\";s:8:\"\u0000*\u0000title\";s:86:\"The Third Homomorphism Theorem on Trees : Downward & Upward Lead to Divide-and-Conquer\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"9\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:86:\"The Third Homomorphism Theorem on Trees : Downward & Upward Lead to Divide-and-Conquer\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:3:\"177\";s:8:\"\u0000*\u0000epage\";s:3:\"185\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"MORIHATA\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Akimasa\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:19:\"MATSUZAKI, Kiminori\";i:1;s:12:\"ZHENJIANG HU\";i:2;s:16:\"TAKEICHI, Masato\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:98:\"Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages\";s:8:\"\u0000*\u0000title\";s:86:\"The Third Homomorphism Theorem on Trees : Downward & Upward Lead to Divide-and-Conquer\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"9\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:86:\"The Third Homomorphism Theorem on Trees : Downward & Upward Lead to Divide-and-Conquer\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:3:\"177\";s:8:\"\u0000*\u0000epage\";s:3:\"185\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"MORIHATA\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Akimasa\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:19:\"MATSUZAKI, Kiminori\";i:1;s:12:\"ZHENJIANG HU\";i:2;s:16:\"TAKEICHI, Masato\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:98:\"Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages\";s:8:\"\u0000*\u0000title\";s:86:\"The Third Homomorphism Theorem on Trees : Downward & Upward Lead to Divide-and-Conquer\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"9\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:86:\"The Third Homomorphism Theorem on Trees : Downward & Upward Lead to Divide-and-Conquer\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:3:\"177\";s:8:\"\u0000*\u0000epage\";s:3:\"185\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"MORIHATA\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Akimasa\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:19:\"MATSUZAKI, Kiminori\";i:1;s:12:\"ZHENJIANG HU\";i:2;s:16:\"TAKEICHI, Masato\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:98:\"Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages\";s:8:\"\u0000*\u0000title\";s:86:\"The Third Homomorphism Theorem on Trees : Downward & Upward Lead to Divide-and-Conquer\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"9\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:86:\"The Third Homomorphism Theorem on Trees : Downward & Upward Lead to Divide-and-Conquer\";s:9:\"\u0000*\u0000jtitle\";s:19:\"ACM SIGPLAN notices\";s:9:\"\u0000*\u0000stitle\";s:15:\"ACM SIGPLAN not\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:2:\"44\";s:8:\"\u0000*\u0000issue\";s:1:\"1\";s:8:\"\u0000*\u0000spage\";s:3:\"177\";s:8:\"\u0000*\u0000epage\";s:3:\"185\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"1523-2867\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"MORIHATA\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Akimasa\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:19:\"MATSUZAKI, Kiminori\";i:1;s:12:\"ZHENJIANG HU\";i:2;s:16:\"TAKEICHI, Masato\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:98:\"Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages\";s:8:\"\u0000*\u0000title\";s:86:\"The Third Homomorphism Theorem on Trees : Downward & Upward Lead to Divide-and-Conquer\";s:8:\"\u0000*\u0000place\";s:12:\"New York, NY\";s:6:\"\u0000*\u0000pub\";s:35:\"Association for Computing Machinery\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"9\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
