default search action
Francisco Maturana
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Saransh Chopra, Francisco Maturana, K. V. Rashmi:
On Low Field Size Constructions of Access-Optimal Convertible Codes. ISIT 2024: 1456-1461 - [c11]Timothy Kim
, Sanjith Athlur
Morph: Efficient File-Lifetime Redundancy Management for Cluster File Systems. SOSP 2024: 330-346 - [c10]Andrew Park, Trevor Leong, Francisco Maturana, Wenting Zheng, K. V. Rashmi:
Communication-efficient, Fault Tolerant PIR over Erasure Coded Storage. SP 2024: 4331-4347 - [i7]Saransh Chopra, Francisco Maturana, K. V. Rashmi:
On Low Field Size Constructions of Access-Optimal Convertible Codes. CoRR abs/2405.09010 (2024) - 2023
- [j4]Francisco Maturana
Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions. IEEE Trans. Inf. Theory 69(8): 4993-5008 (2023) - [c9]Francisco Maturana, K. V. Rashmi:
Locally Repairable Convertible Codes: Erasure Codes for Efficient Repair and Conversion. ISIT 2023: 2033-2038 - 2022
- [j3]Francisco Maturana
Convertible Codes: Enabling Efficient Conversion of Coded Data in Distributed Storage. IEEE Trans. Inf. Theory 68(7): 4392-4407 (2022) - [c8]Francisco Maturana, K. V. Rashmi:
Bandwidth Cost of Code Conversions in the Split Regime. ISIT 2022: 3262-3267 - [c7]Saurabh Kadekodi, Francisco Maturana, Sanjith Athlur, Arif Merchant, K. V. Rashmi, Gregory R. Ganger:
Tiger: Disk-Adaptive Redundancy Without Placement Restrictions. OSDI 2022: 413-429 - [i6]Francisco Maturana, K. V. Rashmi:
Bandwidth Cost of Code Conversions in the Split Regime. CoRR abs/2205.06793 (2022) - 2021
- [j2]Francisco Maturana
Urban Growth, Real Estate Development and Indigenous Property: Simulating the Expansion Process in the City of Temuco, Chile. ISPRS Int. J. Geo Inf. 10(2): 101 (2021) - [c6]Francisco Maturana, K. V. Rashmi:
Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions. ISIT 2021: 2334-2339 - [c5]Francisco Maturana, K. V. Rashmi:
Irregular Array Codes with Arbitrary Access Sets for Geo-Distributed Storage. ISIT 2021: 3002-3007 - [i5]Saurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya, Juncheng Yang, K. V. Rashmi, Gregory R. Ganger:
PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy. CoRR abs/2103.08191 (2021) - 2020
- [c4]Francisco Maturana
Convertible Codes: New Class of Codes for Efficient Conversion of Coded Data in Distributed Storage. ITCS 2020: 66:1-66:26 - [c3]Francisco Maturana, V. S. Chaitanya Mukka, K. V. Rashmi:
Access-optimal Linear MDS Convertible Codes for All Parameters. ISIT 2020: 577-582 - [c2]Saurabh Kadekodi, Francisco Maturana, Suhas Jayaram Subramanya, Juncheng Yang, K. V. Rashmi, Gregory R. Ganger:
PACEMAKER: Avoiding HeART attacks in storage clusters with disk-adaptive redundancy. OSDI 2020: 369-385 - [i4]Francisco Maturana, V. S. Chaitanya Mukka, K. V. Rashmi:
Access-optimal Linear MDS Convertible Codes for All Parameters. CoRR abs/2006.03042 (2020) - [i3]Francisco Maturana, K. V. Rashmi:
Bandwidth Cost of Code Conversions in Distributed Storage: Fundamental Limits and Optimal Constructions. CoRR abs/2008.12707 (2020)
2010 – 2019
- 2019
- [i2]Francisco Maturana, K. V. Rashmi:
Convertible Codes: Efficient Conversion of Coded Data in Distributed Storage. CoRR abs/1907.13119 (2019) - 2018
- [c1]Francisco Maturana, Cristian Riveros
Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity. PODS 2018: 125-136 - 2017
- [i1]Francisco Maturana, Cristian Riveros, Domagoj Vrgoc:
Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity. CoRR abs/1707.00827 (2017) - 2016
- [j1]Marcelo Arenas, Francisco Maturana, Cristian Riveros
A framework for annotating CSV-like data. Proc. VLDB Endow. 9(11): 876-887 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: