Man

Gonzalo Navarro

FULL PROFESSOR

UNIVERSIDAD DE CHILE

Santiago, Chile

Líneas de Investigación


Algorithms and Data Structures; Compression; Information Retrieval; Text Compression and Searching; Data Structures for Information Retrieval; Adaptive Analysis of Algorithms; Optimisation of Information Retrieval Systems; Succinct Data Structures

Educación

  •  Informatics, Latin American School of Informatics ESLAI. Argentina, 1992
  •  Informatics, UNIVERSIDAD NACIONAL DE LA PLATA UNLP. Chile, 1993
  •  COMPUTER SCIENCE, UNIVERSIDAD DE CHILE. Chile, 1995
  •  COMPUTER SCIENCE, UNIVERSIDAD DE CHILE. Chile, 1998

Experiencia Académica

  •   FULL PROFESSOR Full Time

    UNIVERSIDAD DE CHILE

    OF PHYSICS AND MATHEMATICAL SCIENCES

    SANTIAGO, Chile

    1995 - A la fecha

Formación de Capital Humano


In the past 3 years the thesis directed are:
4 Undergraduate: Andrés Abeliuk (2012), Hernán Arroyo (2010), Felipe Sologuren (2009), Daniel Valenzuela (2009)
3 Master: Daniel Valenzuela (2013), Eliana Providel (2012), Sebastián Kreft (2010)
3 PhD: Ana Cerdeira (2013), Susana Ladra (2010), Diego Arroyuelo (2009)


Difusión y Transferencia


Interviewed in magazine Bits of Science, number 5, pages 78-81, April 2011.
"Compact Data Structures", magazine Bits of Science, number 3, pages 2-8, November 2009.
Diverse divulgation articles in column Bits, Science, and Society, of Terra.cl, since July 2009
Interview to Ricardo Baeza-Yates, magazine Bits of Science, number 2, pages 30-31, April 2009.
Co-creator and member of the Editorial Board of the magazine Bits of Science, published by the DCC. Participation with an article in the first issue, August 2008.
"Searching the Web", chapter 4 (pages 51-62) in the book How the Web Works, published by the Center for Web Research, Santiago, Chile, 2008. Also, participation as a panelist, as director of the Center and the DCC, in the public presentation of the book, University of Chile, August 2008. The event was mentioned in several press releases and radio stations.
Interview, as Head of Department, in El Mercurio (one of the main Chilean newspapers), March 24, 2008, page A14 (science and technology), about the p osition of the Department on the OOXML standard proposal.
Opinion article "Data Standards and OOXML: today´s vote", as Head of the DCC and on its behalf, in La Nación (nationwide newspaper), March 19, 2008, page 13.
Interview, as Head of the Center for Web Rsearch, in Radio University, 102.5 FM, March 18, 2008, 7:30 to 8:00 PM. With Claudio Gutierrez.
Interview, with other 3 Faculty professors with a high number of ISI publications, in Revista FCFM (magazine of the Faculty of Physical and Mathematical Sciences, University of Chile), number 41, Summer 2008, "Passion for Research", pages 22-25.
Short interview, as Head of Department, in La Tercera (one of the main Chilean newspapers), January 12, 2007, page 7 of section "University Life". In Spanish.
Interview, as Head of the Center for Web Research, in Radio University of Chile, 102.5 FM, November 15, 2006, 7:00 to 7:30 PM.
Interview as Head of the Center for Web Research, in Bioplanet magazine (Chile), year 6, number 42, September 2006. "Center for Web Research: The Science of Finding it All", pages 15-17. With Ricardo Baeza-Yates. In Spanish.
Interview, as Teaching Coordinator of the Department, in the newpaper Publimetro (Chile), August 17 2006, section Admission 2006, page 6. In Spanish.


Premios y Distinciones

  •   Best score at the Faculty of Exact Sciences

    UNIVERSIDAD NACIONAL DE LA PLATA

    Argentina, 1992

    Best score at the Faculty of Exact Sciences

  •   First Prize in the III CLEI-UNESCO

    CLEI-UNESCO

    Colombia, 1996

    First prize in the III CLEI-UNESCO Contest of Latin American Computer Science MSc. Theses (developed during 1995)


 

Article (44)

Compact representation of Web graphs with extended functionality
Compressed representations for web and social graphs
Encoding range minima and range top-2 queries
Fully Functional Static and Dynamic Succinct Trees
New space/time tradeoffs for top-k document retrieval on sequences
Spaces, Trees, and Colors: The Algorithmic Landscape of Document Retrieval on Sequences
XXS: Efficient XPath Evaluation on Compressed XML Documents
Colored range queries and document retrieval
Compact binary relation representations with rich functionality
DACs: Bringing direct access to variable-length codes
Entropy-bounded representation of point grids
On compressing and indexing repetitive sequences
On compressing permutations and adaptive sorting
Space-efficient data-analysis queries on grids
Space-efficient representations of rectangle datasets supporting orthogonal range querying
Succinct nearest neighbor search
Boosting Text Compression with Word-Based Statistical Encoding(1)
Efficient Fully-Compressed Sequence Representations
Implicit indexing of natural language text by reorganizing bytecodes
New algorithms on wavelet trees and applications to information retrieval
String matching with alphabet sampling
Stronger Lempel-Ziv Based Compressed Text Indexing
Word-Based Self-Indexes for Natural Language Text
Fully Compressed Suffix Trees
Fully dynamic metric access methods based on hyperplane partitioning
Improving semistatic compression via phrase-based modeling
On-line approximate string matching with bounded errors
Self-Indexed Grammar-Based Compression
Space-efficient construction of Lempel-Ziv compressed text indexes
STRONGER QUICKHEAPS
Students' socio-emotional adaptation: Assessment of a new instrument in Concepción city Adaptación socioemocional en escolares: Evaluación de un instrumento nuevo en la provincia de Concepción
Dynamic Lightweight Text Compression
Fast and Compact Web Graph Representations
On Sorting, Heaps, and Minimum Spanning Trees
Storage and Retrieval of Highly Repetitive Sequence Collections
The longest common extension problem revisited and applications to approximate string searching
A Prototype for Querying over LZCS Transformed Documents
Faster entropy-bounded compressed suffix trees
Improving the space cost of k-NN search in metric spaces by using distance estimators
Parameterized matching on non-linear structures
Rank/select on dynamic compressed sequences and applications
Dynamic Entropy-Compressed Sequences and Full-Text Indexes
Effective proximity retrieval by ordering permutations
New adaptive compressors for natural language text

ConferencePaper (54)

Encodings for Range Majority Queries
A Lempel-Ziv Compressed Structure for Document Listing
Compressing Huffman Models on Large Alphabets
Faster Compact Top-k Document Retrieval
Faster Top-k Document Retrieval in Optimal Space
Compressed dynamic binary relations
Compressed representation of web and social networks via dense subgraphs
Compressed suffix trees for repetitive texts
Dual-sorted inverted lists in practice
Fast, small, simple rank/select on bitmaps
Improved grammar-based compressed indexes
Indexing highly repetitive collections
New lower and upper bounds for representing sequences
Ranked document retrieval in (Almost) no space
Smaller self-indexes for natural language
Sorted range reporting
Space-efficient top-k document retrieval
The wavelet matrix
Top-k document retrieval in optimal time and linear space
Wavelet trees for all
Alphabet-independent compressed text indexing
Backwards search in context bound text transformations
Compressed string dictionaries
Improved compressed indexes for full-text document retrieval
Indexes for highly repetitive document collections
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
Practical Compressed Document Retrieval
Self-indexing Based on LZ77
A fun application of compact data structures to indexing geographic data
A new searchable variable-to-variable compressor
Alphabet Partitioning for Compressed Rank/Select and Applications
Compact Rich-Functional Binary Relation Representations
Compressed q-gram indexing for highly repetitive biological sequences
Dual-Sorted Inverted Lists
Extended compact Web graph representations
Fast and compact prefix codes
Fast in-memory Xpath search using compressed indexes
Fully-functional succinct trees
LZ77-like compression with fast random access
Parallel and distributed compressed indexes
Practical Compressed Suffix Trees
Range queries over a compact representation of minimum bounding rectangles
Top-k ranked document search in general text databases
A compressed self-indexed representation of XML documents
A compressed text index on secondary memory
Analyzing Metric Space Indexes: What For?
Dynamic Spatial Approximation Trees for Massive Data
EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory
Indexing Variable Length Substrings for Exact and Approximate Matching
An(other) entropy-bounded compressed suffix tree
Improved dynamic rank-select entropy-bound structures
Practical Rank/Select Queries over Arbitrary Sequences
Re-pair achieves high-order entropy
Speeding Up Pattern Matching by Text Sampling

EditorialMaterial (1)

Special section on Selected Papers from SISAP 2012
117
Gonzalo Navarro

FULL PROFESSOR

COMPUTER SCIENCE

UNIVERSIDAD DE CHILE

Santiago, Chile

15
Francisco Claude

Assistant Professor

Informática y Telecomunicaciones

Universidad Diego Portales

Santiago, Chile

7
Jeremy Barbay

Assistant Professor

Universidad de Chile

Santiago, Chile

4
Diego Arroyuelo

Full-time Professor

Departamento de Informática

UNIVERSIDAD TÉCNICA FEDERICO SANTA MARÍA

Santiago, Chile

2
Roberto Uribe

Académico

Ingeniería en Computación

Universidad de Magallanes

Punta Arenas, Chile

1
José Merino

Full Professor

Sociology

UNIVERSIDAD DE CONCEPCION

Concepción, Chile

1
Cecilia Hernández

Profesor Asistente

UNIVERSIDAD DE CONCEPCION

Concepción, Chile

1
Marcos Kiwi

Full Professor

Ingeniería Civil Matemática

UNIVERSIDAD DE CHILE

Santiago, Chile

1
Benjamin Bustos

UNIVERSIDAD DE CHILE, DEPARTAMENTO DE CIENCIAS DE LA COMPUTACIÓN

Santiago, Chile

1
Diego Seco

Associate Professor

DIICC

Universidad de Concepción

Concepción, Chile