activity
20002025
most citedQuantum query complexity of some graph problems

108 citations · 187 across the 8 of their papers we have counts for

collaborators

8 papers

cs.SI2025★ 2 cited

Detecting Narrative Shifts through Persistent Structures: A Topological Analysis of Media Discourse

Mark M. Bailey, Mark I. Heiligman

How can we detect when global events fundamentally reshape public discourse? This study introduces a topological framework for identifying structural change in media narratives usi…

math.AG2015

Mult-Projective Models for Jacobian Varieties of Genus Two Curves

Mark Heiligman

A set of multi-homogeneous equations for the Jacobian of a genus two curve is given. The approach used is to write down affine equations for the Jacobian minus various tranlations…

quant-ph2011

Quantum Verification of Minimum Spanning Tree

Mark Heiligman

Previous studies has shown that for a weighted undirected graph having vertices and edges, a minimal weight spanning tree can be found with calls to the we…

math.CO2011★ 1 cited

Sequentiality Restrictions in Special Relativity

Mark Heiligman

Observers in different inertial frames can see a set of spacelike separated events as occurring in different orders. Various restrictions are studied on the possible orderings of e…

quant-ph2004★ 108 cited

Quantum query complexity of some graph problems

Christoph Durr, Mark Heiligman, Peter Hoyer +1

Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for…

quant-ph2003★ 6 cited

Quantum Algorithms for Lowest Weight Paths and Spanning Trees in Complete Graphs

Mark Heiligman

Quantum algorithms for several problems in graph theory are considered. Classical algorithms for finding the lowest weight path between two points in a graph and for finding a mini…