Lila Fontes

13 papers A 1B 2Journal 7Unranked 2
YearRankTypeTitle / Venue / Authors
2023 — conf
Efficient Parallelization of Dynamic Programming for Large Applications.
PEARC
Matilda Ferguson, Lila Fontes, Tia Newhall
2023 B conf
The Communication Complexity of Functions with Large Outputs.
SIROCCO
Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin
2023 J jnl
The communication complexity of functions with large outputs.
CoRR
Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin
2023 J jnl
The communication complexity of functions with large outputs.
Electron. Colloquium Comput. Complex.
Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin
2019 — —
Trading Privacy for Communication.
Lila Fontes
2016 J jnl
Relative Discrepancy Does Not Separate Information and Communication Complexity.
ACM Trans. Comput. Theory
Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
2015 — conf
Relative Discrepancy Does not Separate Information and Communication Complexity.
ICALP (1)
Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
2015 J jnl
Relative Discrepancy does not separate Information and Communication Complexity.
Electron. Colloquium Comput. Complex.
Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
2014 J jnl
The Hardness of Being Private.
ACM Trans. Comput. Theory
Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, Toniann Pitassi
2012 J jnl
Formal Theories for Linear Algebra
Log. Methods Comput. Sci.
Stephen A. Cook, Lila Fontes
2012 A conf
The Hardness of Being Private.
CCC
Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, Toniann Pitassi
2010 B conf
Formal Theories for Linear Algebra.
CSL
Stephen A. Cook, Lila Fontes
2010 J jnl
Formal Theories for Logspace Counting
CoRR
Lila Fontes