Skip To Main Content
Serge Gaspers on Muck Rack

Serge Gaspers

As seen in: arXiv
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Serge

Contact Serge, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

Computer Science > Data Structures and Algorithms

|
By Serge Gaspers, Simon Mackenzie, Qi Wang
| arXiv
We give faster exponential-time randomised approximation algorithms for counting problems where polynomial-time approximation is unavailable and exact exponential-time counting remains expensive. For general \(n\)-vertex graphs, our independent-set counter runs in \(O^{\ast}(1.1869^{n})\) time, improving the previous \(O^{\ast}(1.2041^{n})\) general-graph bound.
Open in Who Shared Issue with article?

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach

|
By Serge Gaspers, Tao He, Simon Mackenzie, Tao Zixu
| arXiv
Open in Who Shared Issue with article?

[2402.10015] A Piecewise Approach for the Analysis of Exact Algorithms

|
By Abdallah Saffidine, Serge Gaspers, Tiankuang Zhang
| arXiv
Open in Who Shared Issue with article?
See all 3 articles