In today's data-driven era, the speed and accuracy of information retrieval have become increasingly important. Since I first proposed the EFANNA algorithm during my doctoral studies in 2016, I ...

Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

We investigate the rank of the adjacency matrix of large diluted random graphs: for a sequence of graphs (G n ) n≥0 converging locally to a Galton—Watson tree T (GWT), we provide an explicit formula ...

TigerGraph, a company that provides a graph database and analytics software, has expanded its data science library with 20 new algorithms, bringing its total to more than 50 algorithms. Graph ...

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

It hadn’t occurred to me in quite these terms before, but Google has an algorithm for its Knowledge Graph. I have been tracking the Knowledge Graph API for five years. The resultScores have always ...

We study how the structure of the interaction graph of a game affects the existence of pure Nash equilibria. In particular, for a fixed interaction graph, we are interested in whether there are pure ...