Skip to main content
Maximilian Probst Gutenberg on Muck Rack

Maximilian Probst Gutenberg

As seen in: Techstreet Now
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 Maximilian Probst

Contact Maximilian Probst, 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 Maximilian Probst Gutenberg, Christian Wulff-Nilsen
| arxiv.org
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Open in Who Shared View Duplicates (412) Issue with article?

Random-Shift Revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings

|
By Maximilian Probst, Maximilian Probst Gutenberg, Tim Rieder
| arxiv.org
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Open in Who Shared View Duplicates (396) Issue with article?

Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal

|
By Maximilian Probst, Simon Meierhans, Maximilian Probst Gutenberg, Thatchaphol Saranurak
| arxiv.org
Open in Who Shared Issue with article?
See all 5 articles