Skip To Main Content
Debmalya Panigrahi on Muck Rack

Debmalya Panigrahi

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 Debmalya

Contact Debmalya, 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 Roie Levin, Joseph Naor, Debmalya Panigrahi
| arXiv
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 (690) Issue with article?

[2508.14287] Nearly Tight Bounds for the Online Sorting Problem

|
By Debmalya Panigrahi, Or Vardi
| arXiv
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 (440) Issue with article?

[2307.11913] Efficient Algorithms and Hardness Results for the Weighted $k$-Server Problem

|
By Amit Kumar, Debmalya Panigrahi
| arXiv
arXiv:2307.11913 (cs) Download a PDF of the paper titled Efficient Algorithms and Hardness Results for the Weighted $k$-Server Problem, by Anupam Gupta and 2 other authors Download PDF Submission history From: Debmalya Panigrahi [ view email] [v1] Fri, 21 Jul 2023 21:33:36 UTC (26 KB) Bibliographic Tools Bibliographic Explorer Toggle Bibliographic Explorer () Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Links to...
Open in Who Shared View Duplicates (676) Issue with article?
See all 3 articles