default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPablo Ariel Heiber
Person information
- affiliation: Google
- affiliation (PhD 2014): University of Buenos Aires, Argentina
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i4]Binghong Chen, Daniel Tarlow, Kevin Swersky, Martin Maas, Pablo Ariel Heiber, Ashish Naik, Milad Hashemi, Parthasarathy Ranganathan:
Learning to Improve Code Efficiency. CoRR abs/2208.05297 (2022)
2010 – 2019
- 2018
- [j10]Verónica Becher
, Olivier Carton, Pablo Ariel Heiber:
Finite-State Independence. Theory Comput. Syst. 62(7): 1555-1572 (2018) - 2016
- [i3]Verónica Becher, Olivier Carton, Pablo Ariel Heiber:
Finite-state independence. CoRR abs/1611.03921 (2016) - 2015
- [j9]Olivier Carton, Pablo Ariel Heiber:
Normality and two-way automata. Inf. Comput. 241: 264-276 (2015) - [j8]Verónica Becher, Olivier Carton, Pablo Ariel Heiber:
Normality and automata. J. Comput. Syst. Sci. 81(8): 1592-1613 (2015) - [j7]Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman:
A computable absolutely normal Liouville number. Math. Comput. 84(296): 2939-2952 (2015) - 2013
- [j6]Pablo Barenbaum, Verónica Becher, Alejandro Deymonnaz, Melisa Halsband, Pablo Ariel Heiber:
Efficient repeat finding in sets of strings via suffix arrays. Discret. Math. Theor. Comput. Sci. 15(2): 59-70 (2013) - [j5]Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman:
A polynomial-time algorithm for computing absolutely normal numbers. Inf. Comput. 232: 1-9 (2013) - [j4]Verónica Becher, Pablo Ariel Heiber:
Normal numbers and finite automata. Theor. Comput. Sci. 477: 109-116 (2013) - [i2]Verónica Becher, Alejandro Deymonnaz, Pablo Ariel Heiber:
Efficient repeat finding via suffix arrays. CoRR abs/1304.0528 (2013) - [i1]Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman:
Normal Numbers and the Borel Hierarchy. CoRR abs/1311.0335 (2013) - 2012
- [j3]Verónica Becher, Pablo Ariel Heiber:
A linearly computable measure of string complexity. Theor. Comput. Sci. 438: 62-73 (2012) - 2011
- [j2]Verónica Becher, Pablo Ariel Heiber:
On extending de Bruijn sequences. Inf. Process. Lett. 111(18): 930-932 (2011)
2000 – 2009
- 2009
- [j1]Verónica Becher, Alejandro Deymonnaz, Pablo Ariel Heiber:
Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome. Bioinform. 25(14): 1746-1753 (2009) - [c3]Esteban Feuerstein, Pablo Ariel Heiber, Matías Lopez-Rosenfeld, Marcelo Mydlarz:
Optimal Auctions Capturing Constraints in Sponsored Search. AAIM 2009: 188-201 - 2008
- [c2]Esteban Feuerstein, Pablo Ariel Heiber, Marcelo Mydlarz:
Truthful Stochastic and Deterministic Auctions for Sponsored Search. LA-WEB 2008: 39-48 - 2007
- [c1]Esteban Feuerstein, Pablo Ariel Heiber, Javier Martínez-Viademonte, Ricardo A. Baeza-Yates:
New Stochastic Algorithms for Scheduling Ads in Sponsored Search. LA-WEB 2007: 22-31
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-05-02 21:02 CEST 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:
