Welcome to U-papers
A publications repository from the Computer Science Department of the University of Chile
Latest publications
| 291. |
Making Visible the Invisible: Understanding the Nuances of
Computer-Supported Cooperative Work on Informal Elderly Caregiving in
Southern Cone Families.
Journal: Personal and Ubiquitous Computing. Volume: 25. Pages: 437-456. Date: 2021. Authors: Francisco Gutierrez, Sergio Ochoa |
|
| 292. |
The Marriage of Univalence and Parametricity.
Journal: Journal of the ACM. Volume: 68. Issue: 1. Pages: 5:1-5:44. Date: January 2021. Authors: Nicolas Tabareau, Éric Tanter, Matthieu Sozeau |
|
| 293. |
On the Approximation Ratio of Ordered Parsings.
Journal: IEEE Transactions on Information Theory. Volume: 67. Issue: 2. Pages: 1008-1026. Date: 2021. Authors: Gonzalo Navarro, Carlos Ochoa, Nicola Prezza |
|
| 294. |
Compact Structure for Sparse Undirected Graphs based on a Clique Graph Partition.
Journal: Information Sciences. Volume: 544. Pages: 485-499. Date: 2021. Authors: Felipe Glaria, Cecilia Hernández, Susana Ladra, Gonzalo Navarro, Lilian Salinas |
|
| 295. |
Interventions Recommendation: Professionals' Observations
Analysis in Special Needs Education.
Conference: Workshop on Innovative Use of NLP for Building Educational Applications. Publisher: Association for Computational Linguistic. Pages: 171-179. Date: 2021. Authors: Javier Muñoz, Felipe Bravo-Marquez |
|
| 296. |
Changing Teacher Perceptions about Computational Thinking in
Grades
1-6, through a National Training Program.
Conference: ACM Technical Symposium on Computer Science Education (Virtual Event). Publisher: ACM Press. Pages: 260-266. Date: 2021. Authors: Jocelyn Simmonds, Francisco Gutierrez, Federico Meza, Catalina Torrent, Jaime Villalobos |
|
| 297. |
PolyLM: Learning about Polysemy through Language
Modeling.
Conference: European Chapter of the Association for Computational Linguistics. Publisher: Association for Computational Linguistic. Pages: 563-574. Date: 2021. Authors: Alan Ansell, Felipe Bravo-Marquez, Bernhard Pfahringer |
|
| 298. |
The Computational Complexity of Evil Hangman.
Conference: International Conference on Fun with Algorithms. Publisher: Springer-Verlag. Pages: 23:1-23:12. Date: 2021. Authors: Jérémy Barbay, Bernardo Subercaseaux |
|
| 299. |
PFP Compressed Suffix Trees.
Conference: Workshop on Algorithm Engineering and Experiments (online). Publisher: SIAM Press. Pages: 60-72. Date: 2021. Authors: Christina Boucher, Ondrej Cvacho, Travis Gagie, Jan Holub, Giovanni Manzini, Gonzalo Navarro, Massimiliano Rossi |
|
| 300. |
From Adaptive Analysis to Instance Optimality.
Editors: Tim Roughgarden. Book title: Beyond the Worst-Case Analysis of Algorithms. Publisher: Cambridge University Press. Pages: 52-71. Date: 2021. Authors: Jérémy Barbay |
|