Marcos A. Kiwi

Orcid: 0000-0003-4171-2656

Affiliations:
  • University of Chile, Santiago, Chile


According to our database1, Marcos A. Kiwi authored at least 43 papers between 1992 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Label propagation on binomial random graphs.
CoRR, 2023

2022
Cover and Hitting Times of Hyperbolic Random Graphs.
Proceedings of the Approximation, 2022

2021
Quasi-random words and limits of word sequences.
Eur. J. Comb., 2021

2020
A perspective on theoretical computer science in Latin America.
Commun. ACM, 2020

2019
On the Second Largest Component of Random Hyperbolic Graphs.
SIAM J. Discret. Math., 2019

2017
FIFO Queues Are Bad for Rumor Spreading.
IEEE Trans. Inf. Theory, 2017

2016
Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations.
Discret. Appl. Math., 2016

Repetition-free longest common subsequence of random sequences.
Discret. Appl. Math., 2016

2015
Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays.
Comb. Probab. Comput., 2015

Adaptive Rumor Spreading.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

A Bound for the Diameter of Random Hyperbolic Graphs.
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014
Strict Majority Bootstrap Percolation in the r-wheel.
Inf. Process. Lett., 2014

Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings.
Discret. Appl. Math., 2014

2012
Strong accumulators from collision-resistant hashing.
Int. J. Inf. Sec., 2012

2011
On-line approximate string matching with bounded errors.
Theor. Comput. Sci., 2011

Counting perfect matchings in the geometric dual.
Electron. Notes Discret. Math., 2011

Computational Hardness of Enumerating Satisfying Spin-Assignments in Triangulations
CoRR, 2011

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

2010
Satisfying States of Triangulations of a Convex n-gon.
Electron. J. Comb., 2010

2009
Adversarial queuing theory with setups.
Theor. Comput. Sci., 2009

On a Speculated Relation Between Chvátal-Sankoff Constants of Several Sequences.
Comb. Probab. Comput., 2009

2008
Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs.
Electron. J. Comb., 2008

Foreword.
Algorithmica, 2008

2006
A concentration bound for the longest increasing subsequence of a randomly chosen involution.
Discret. Appl. Math., 2006

Adversarial Queueing Theory Revisited.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

2004
The chilean highway problem.
Theor. Comput. Sci., 2004

Electronic jury voting protocols.
Theor. Comput. Sci., 2004

Expected Length of the Longest Common Subsequence for Large Alphabets.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
Algebraic testing and weight distributions of codes.
Theor. Comput. Sci., 2003

Approximate testing with error relative to input size.
J. Comput. Syst. Sci., 2003

2002
Largest planar matching in random bipartite graphs.
Random Struct. Algorithms, 2002

2001
Min-max-boundary domain decomposition.
Theor. Comput. Sci., 2001

Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Electron. Colloquium Comput. Complex., 2001

2000
Threshold data structures and coding theory.
Theor. Comput. Sci., 2000

Alternation in interaction.
Comput. Complex., 2000

1999
Strength of two data encryption standard implementations under timing attacks.
ACM Trans. Inf. Syst. Secur., 1999

Approximate Testing with Relative Error.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1997
Testing and Weight Distributions of Dual Codes
Electron. Colloquium Comput. Complex., 1997

1996
Linearity testing in characteristic two.
IEEE Trans. Inf. Theory, 1996

1994
No Polynomial Bound for the Period of the Parallel Chip Firing Game on Graphs.
Theor. Comput. Sci., 1994

1993
Games on Line Graphs and Sand Piles.
Theor. Comput. Sci., 1993

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

Dynamics of Sand-Piles Games on Graphs.
Proceedings of the LATIN '92, 1992


  Loading...