I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Akmal, Shyan
24
results:
Search for persons
X
Format
Online (24)
Mediatypes
Articles (Online) (6)
Bookchapter (Online) (1)
OpenAccess-fulltext (17)
Sorted by: Relevance
Sorted by: Year
?
1
An Efficient Algorithm for All-Pairs Bounded Edge Connectiv..:
Akmal, Shyan
;
Jin, Ce
Algorithmica. 86 (2024) 5 - p. 1623-1656 , 2024
Link:
https://doi.org/10.1007/..
?
2
Near-Optimal Quantum Algorithms for String Problems:
Akmal, Shyan
;
Jin, Ce
Algorithmica. 85 (2023) 8 - p. 2260-2317 , 2023
Link:
https://doi.org/10.1007/..
?
3
Improved Merlin–Arthur Protocols for Central Problems in Fi..:
Akmal, Shyan
;
Chen, Lijie
;
Jin, Ce
..
Algorithmica. 85 (2023) 8 - p. 2395-2426 , 2023
Link:
https://doi.org/10.1007/..
?
4
MAJORITY-3SAT (and Related Problems) in Polynomial Time:
, In:
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
,
Akmal, Shyan
;
Williams, Ryan
- p. 1033-1043 , 2022
Link:
https://doi.org/10.1109/..
?
5
Quantifying controllability in temporal networks with uncer..:
Akmal, Shyan
;
Ammons, Savana
;
Li, Hemeng
...
Artificial Intelligence. 289 (2020) - p. 103384 , 2020
Link:
https://doi.org/10.1016/..
?
6
On a convex set with nondifferentiable metric projection:
Akmal, Shyan S.
;
Nam, Nguyen Mau
;
Veerman, J. J. P.
Optimization Letters. 9 (2015) 6 - p. 1039-1052 , 2015
Link:
https://doi.org/10.1007/..
?
7
An Efficient Algorithm for All-Pairs Bounded Edge Connectiv..:
Akmal, Shyan
;
Jin, Ce
https://doi.org/10.1007/s00453-023-01203-2. , 2024
Link:
https://hdl.handle.net/1..
?
8
An Efficient Algorithm for All-Pairs Bounded Edge Connectiv..:
Akmal, Shyan
;
Jin, Ce
http://arxiv.org/abs/2305.02132. , 2023
Link:
http://arxiv.org/abs/230..
?
9
An Enumerative Perspective on Connectivity:
Akmal, Shyan
http://arxiv.org/abs/2310.12889. , 2023
Link:
http://arxiv.org/abs/231..
?
10
Faster Detours in Undirected Graphs:
Akmal, Shyan
;
Williams, Virginia Vassilevska
;
Williams, Ryan
.
http://arxiv.org/abs/2307.01781. , 2023
Link:
http://arxiv.org/abs/230..
?
11
Near-Optimal Quantum Algorithms for String Problems:
Akmal, Shyan
;
Jin, Ce
https://doi.org/10.1007/s00453-022-01092-x. , 2023
Link:
https://hdl.handle.net/1..
?
12
Improved Merlin–Arthur Protocols for Central Problems in Fi..:
Akmal, Shyan
;
Chen, Lijie
;
Jin, Ce
..
https://doi.org/10.1007/s00453-023-01102-6. , 2023
Link:
https://hdl.handle.net/1..
?
13
A Local-to-Global Theorem for Congested Shortest Paths:
Akmal, Shyan
;
Wein, Nicole
http://arxiv.org/abs/2211.07042. , 2022
Link:
http://arxiv.org/abs/221..
?
14
Improved Merlin-Arthur Protocols for Central Problems in Fi..:
Akmal, Shyan
;
Chen, Lijie
;
Jin, Ce
..
doi:10.4230/LIPIcs.ITCS.2022.3. , 2022
Link:
https://doi.org/10.4230/..
?
15
Improved Approximation for Longest Common Subsequence over ..:
Akmal, Shyan
;
Vassilevska Williams, Virginia
doi:10.4230/LIPIcs.ICALP.2021.13. , 2021
Link:
https://doi.org/10.4230/..
1-15