Nicolas Rivera

Orcid: 0000-0003-3368-9708

According to our database1, Nicolas Rivera authored at least 33 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A General Framework for the Analysis of Kernel-based Tests.
J. Mach. Learn. Res., 2024

Finding a Small, Diverse Subset of the Pareto Solution Set in Bi-Objective Search (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Rumors with Changing Credibility.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Multiple random walks on graphs: mixing few to cover many.
Comb. Probab. Comput., 2023

Distributed Averaging in Opinion Dynamics.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022
Distributed Averaging in Population Protocols.
CoRR, 2022

A Multiple kernel testing procedure for non-proportional hazards in factorial designs.
CoRR, 2022

Subset Approximation of Pareto Regions with Bi-Objective A* (Extended Abstract).
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Subset Approximation of Pareto Regions with Bi-objective A.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Diversity, Fairness, and Sustainability in Population Protocols.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020
The 2^k Neighborhoods for Grid Path Planning.
J. Artif. Intell. Res., 2020

Kernelized Stein Discrepancy Tests of Goodness-of-fit for Time-to-Event Data.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs.
ACM Trans. Parallel Comput., 2019

The Dispersion Time of Random Walks on Finite Graphs.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Best-of-Three Voting on Dense Graphs.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

2018
Discordant Voting Processes on Finite Graphs.
SIAM J. Discret. Math., 2018

Dispersion processes.
Random Struct. Algorithms, 2018

Threshold behaviour of discordant voting on the complete graph.
J. Discrete Algorithms, 2018

A Suboptimality Bound for 2<sup>k</sup> Grid Path Planning.
Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

2017
Fast Plurality Consensus in Regular Expanders.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Multi-Agent Flag Coordination Games.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Grid Pathfinding on the 2<i>k</i> Neighborhoods.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
The Coalescing-Branching Random Walk on Expanders and the Dual Epidemic Process.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Gaussian Processes for Survival Analysis.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

The Linear Voting Model.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Incorporating weights into real-time heuristic search.
Artif. Intell., 2015

Fast Consensus for Voting on General Expander Graphs.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Coalescing Walks on Rotor-Router Systems.
Proceedings of the Structural Information and Communication Complexity, 2015

2014
Reconnection with the Ideal Tree: A New Approach to Real-Time Search.
J. Artif. Intell. Res., 2014

Real-Time Pathfinding in Unknown Terrain via Reconnection with an Ideal Tree.
Proceedings of the Advances in Artificial Intelligence - IBERAMIA 2014, 2014

2013
Reconnecting with the Ideal Tree: An Alternative to Heuristic Learning in Real-Time Search.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Weighted real-time heuristic search.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013


  Loading...