default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShyan Akmal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2024
[b1]Shyan Akmal:
Parameterized Relaxations for Circuits and Graphs. MIT, USA, 2024
Journal Articles
- 2024
- [j5]Shyan Akmal
, Ce Jin:
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. Algorithmica 86(5): 1623-1656 (2024) - 2023
- [j4]Shyan Akmal, Ce Jin:
Near-Optimal Quantum Algorithms for String Problems. Algorithmica 85(8): 2260-2317 (2023) - [j3]Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, R. Ryan Williams:
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Algorithmica 85(8): 2395-2426 (2023) - 2020
- [j2]Shyan Akmal, Savana Ammons, Hemeng Li, Michael Gao, Lindsay Popowski, James C. Boerkoel Jr.:
Quantifying controllability in temporal networks with uncertainty. Artif. Intell. 289: 103384 (2020) - 2015
- [j1]Shyan S. Akmal, Nguyen Mau Nam, J. J. P. Veerman:
On a convex set with nondifferentiable metric projection. Optim. Lett. 9(6): 1039-1052 (2015)
Conference and Workshop Papers
- 2024
- [c11]Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein:
Detecting Disjoint Shortest Paths in Linear Time and More. ICALP 2024: 9:1-9:17 - [c10]Shyan Akmal:
An Enumerative Perspective on Connectivity. SOSA 2024: 179-198 - 2023
- [c9]Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams, Zixuan Xu:
Faster Detours in Undirected Graphs. ESA 2023: 7:1-7:17 - [c8]Shyan Akmal, Nicole Wein:
A Local-To-Global Theorem for Congested Shortest Paths. ESA 2023: 8:1-8:17 - [c7]Shyan Akmal, Ce Jin:
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. ICALP 2023: 11:1-11:20 - 2022
- [c6]Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams:
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. ITCS 2022: 3:1-3:25 - [c5]Shyan Akmal, Ce Jin:
Near-Optimal Quantum Algorithms for String Problems. SODA 2022: 2791-2832 - 2021
- [c4]Shyan Akmal, Ryan Williams:
MAJORITY-3SAT (and Related Problems) in Polynomial Time. FOCS 2021: 1033-1043 - [c3]Shyan Akmal, Ce Jin:
Faster Algorithms for Bounded Tree Edit Distance. ICALP 2021: 12:1-12:15 - [c2]Shyan Akmal, Virginia Vassilevska Williams:
Improved Approximation for Longest Common Subsequence over Small Alphabets. ICALP 2021: 13:1-13:18 - 2019
- [c1]Shyan Akmal, Savana Ammons, Hemeng Li, James C. Boerkoel Jr.:
Quantifying Degrees of Controllability in Temporal Networks with Uncertainty. ICAPS 2019: 22-30
Informal and Other Publications
- 2024
- [i10]Shyan Akmal, Virginia Vassilevska Williams, Nicole Wein:
Detecting Disjoint Shortest Paths in Linear Time and More. CoRR abs/2404.15916 (2024) - 2023
- [i9]Shyan Akmal, Ce Jin:
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. CoRR abs/2305.02132 (2023) - [i8]Shyan Akmal, Virginia Vassilevska Williams, R. Ryan Williams, Zixuan Xu:
Faster Detours in Undirected Graphs. CoRR abs/2307.01781 (2023) - [i7]Shyan Akmal:
An Enumerative Perspective on Connectivity. CoRR abs/2310.12889 (2023) - 2022
- [i6]Shyan Akmal, Nicole Wein:
A Local-to-Global Theorem for Congested Shortest Paths. CoRR abs/2211.07042 (2022) - 2021
- [i5]Shyan Akmal, Ce Jin:
Faster Algorithms for Bounded Tree Edit Distance. CoRR abs/2105.02428 (2021) - [i4]Shyan Akmal, Virginia Vassilevska Williams:
Improved Approximation for Longest Common Subsequence over Small Alphabets. CoRR abs/2105.03028 (2021) - [i3]Shyan Akmal, R. Ryan Williams:
MAJORITY-3SAT (and Related Problems) in Polynomial Time. CoRR abs/2107.02748 (2021) - [i2]Shyan Akmal, Ce Jin:
Near-Optimal Quantum Algorithms for String Problems. CoRR abs/2110.09696 (2021) - [i1]Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams:
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Electron. Colloquium Comput. Complex. TR21 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-29 21:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
