Marcos A. Kiwi

Dimitrios Los

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Label propagation on binomial random graphs.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Cover and Hitting Times of Hyperbolic Random Graphs.

[BibT_eX]

[DOI]

Markus Schepers

John Sylvester

Proceedings of the Approximation, 2022

2021

Quasi-random words and limits of word sequences.

[BibT_eX]

[DOI]

Hiêp Hàn

Matías Pavez-Signé

Eur. J. Comb., 2021

2020

A perspective on theoretical computer science in Latin America.

[BibT_eX]

[DOI]

Francisco Rodríguez-Henríquez

Yoshiharu Kohayakawa

Sergio Rajsbaum

Jayme Luiz Szwarcfiter

Alfredo Viola

Commun. ACM, 2020

2019

On the Second Largest Component of Random Hyperbolic Graphs.

[BibT_eX]

[DOI]

Dieter Mitsche

SIAM J. Discret. Math., 2019

2017

FIFO Queues Are Bad for Rumor Spreading.

[BibT_eX]

[DOI]

Christopher Thraves Caro

IEEE Trans. Inf. Theory, 2017

2016

Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Repetition-free longest common subsequence of random sequences.

[BibT_eX]

[DOI]

Cristina G. Fernandes

Discret. Appl. Math., 2016

2015

Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays.

[BibT_eX]

[DOI]

José A. Soto

Comb. Probab. Comput., 2015

Adaptive Rumor Spreading.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

A Bound for the Diameter of Random Hyperbolic Graphs.

[BibT_eX]

[DOI]

Dieter Mitsche

Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014

Strict Majority Bootstrap Percolation in the r-wheel.

[BibT_eX]

[DOI]

Pablo Moisset de Espanés

Ivan Rapaport

Sergio Rica

Guillaume Theyssier

Inf. Process. Lett., 2014

Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2012

Strong accumulators from collision-resistant hashing.

[BibT_eX]

[DOI]

Int. J. Inf. Sec., 2012

2011

On-line approximate string matching with bounded errors.

[BibT_eX]

[DOI]

Gonzalo Navarro

Claudio Telha

Theor. Comput. Sci., 2011

Counting perfect matchings in the geometric dual.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Computational Hardness of Enumerating Satisfying Spin-Assignments in Triangulations

[BibT_eX]

[DOI]

CoRR, 2011

Generalizations and Variants of the Largest Non-crossing Matching Problem in Random Bipartite Graphs

[BibT_eX]

[DOI]

José A. Soto

CoRR, 2011

2010

Satisfying States of Triangulations of a Convex n-gon.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

2009

Adversarial queuing theory with setups.

[BibT_eX]

[DOI]

Mauricio Soto

Christopher Thraves

Theor. Comput. Sci., 2009

On a Speculated Relation Between Chvátal-Sankoff Constants of Several Sequences.

[BibT_eX]

[DOI]

José A. Soto

Comb. Probab. Comput., 2009

2008

Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Foreword.

[BibT_eX]

[DOI]

José R. Correa

Algorithmica, 2008

2006

A concentration bound for the longest increasing subsequence of a randomly chosen involution.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

Adversarial Queueing Theory Revisited.

[BibT_eX]

[DOI]

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

2004

The chilean highway problem.

[BibT_eX]

[DOI]

Alexander Russell

Theor. Comput. Sci., 2004

Electronic jury voting protocols.

[BibT_eX]

[DOI]

Alejandro Hevia

Theor. Comput. Sci., 2004

Expected Length of the Longest Common Subsequence for Large Alphabets.

[BibT_eX]

[DOI]

Jirí Matousek

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003

Algebraic testing and weight distributions of codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Approximate testing with error relative to input size.

[BibT_eX]

[DOI]

Frédéric Magniez

Miklos Santha

J. Comput. Syst. Sci., 2003

2002

Largest planar matching in random bipartite graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

2001

Min-max-boundary domain decomposition.

[BibT_eX]

[DOI]

Daniel A. Spielman

Shang-Hua Teng

Theor. Comput. Sci., 2001

Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey

[BibT_eX]

[DOI]

Frédéric Magniez

Miklos Santha

Electron. Colloquium Comput. Complex., 2001

2000

Threshold data structures and coding theory.

[BibT_eX]

[DOI]

Eric Bach

Theor. Comput. Sci., 2000

Alternation in interaction.

[BibT_eX]

[DOI]

Comput. Complex., 2000

1999

Strength of two data encryption standard implementations under timing attacks.

[BibT_eX]

[DOI]

Alejandro Hevia

ACM Trans. Inf. Syst. Secur., 1999

Approximate Testing with Relative Error.

[BibT_eX]

[DOI]

Frédéric Magniez

Miklos Santha

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1997

Testing and Weight Distributions of Dual Codes

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1997

1996

Linearity testing in characteristic two.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

1994

No Polynomial Bound for the Period of the Parallel Chip Firing Game on Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

1993

Games on Line Graphs and Sand Piles.

[BibT_eX]

[DOI]

Eric Goles Ch.

Theor. Comput. Sci., 1993

1992

A lower bound on the computational complexity of the QR decomposition on a shared memory SIMD computer.

[BibT_eX]

[DOI]

Eric Goles Ch.

Parallel Comput., 1992

Dynamics of Sand-Piles Games on Graphs.

[BibT_eX]

[DOI]

Eric Goles Ch.