受强制性开放获取政策约束的文章 - Uri Zwick了解详情
可在其他位置公开访问的文章：18 篇
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor
TD Hansen, PB Miltersen, U Zwick
Journal of the ACM (JACM) 60 (1), 1-16, 2013
强制性开放获取政策： Danish Council for Independent Research, Danish National Research Foundation …
Faster k-SAT algorithms using biased-PPSZ
TD Hansen, H Kaplan, O Zamir, U Zwick
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
强制性开放获取政策： Villum Foundation, Federal Ministry of Education and Research, Germany
Adjacency labeling schemes and induced-universal graphs
S Alstrup, H Kaplan, M Thorup, U Zwick
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
强制性开放获取政策： Danish Council for Independent Research
An improved version of the random-facet pivoting rule for the simplex algorithm
TD Hansen, U Zwick
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
强制性开放获取政策： Danish Council for Independent Research
Union-find with constant time deletions
S Alstrup, IL Gørtz, T Rauhe, M Thorup, U Zwick
ACM Trans. Algorithms 11 (1), 6:1-6:28, 2014
强制性开放获取政策： Danish Council for Independent Research
Hollow heaps
TD Hansen, H Kaplan, RE Tarjan, U Zwick
ACM Transactions on Algorithms (TALG) 13 (3), 1-27, 2017
强制性开放获取政策： US National Science Foundation, 国家自然科学基金委员会, Danish Council for …
Adjacency labeling schemes and induced-universal graphs
S Alstrup, H Kaplan, M Thorup, U Zwick
SIAM Journal on Discrete Mathematics 33 (1), 116-137, 2019
强制性开放获取政策： US National Science Foundation, Danish Council for Independent Research …
A Faster Deterministic Exponential Time Algorithm for Energy Games and Mean Payoff Games (Track B: Automata, Logic, Semantics, and Theory of Programming)
D Dorfman, H Kaplan, U Zwick
46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
强制性开放获取政策： Villum Foundation, Federal Ministry of Education and Research, Germany
Improved upper bounds for random-edge and random-jump on abstract cubes
TD Hansen, M Paterson, U Zwick
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014
强制性开放获取政策： Danish Council for Independent Research, UK Engineering and Physical …
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles
TD Hansen, H Kaplan, U Zwick
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014
强制性开放获取政策： Danish Council for Independent Research
Random k-out subgraph leaves only O (n/k) inter-component edges
J Holm, V King, M Thorup, O Zamir, U Zwick
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
Separating max 2-and, max di-cut and max cut
J Brakensiek, N Huang, A Potechin, U Zwick
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
强制性开放获取政策： US National Science Foundation
Algorithmic trade-offs for girth approximation in undirected graphs
A Kadria, L Roditty, A Sidford, VV Williams, U Zwick
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
强制性开放获取政策： US National Science Foundation
On the mysteries of MAX NAE-SAT
J Brakensiek, N Huang, A Potechin, U Zwick
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
强制性开放获取政策： US National Science Foundation
Tight approximability of MAX 2-SAT and relatives, under UGC
J Brakensiek, N Huang, U Zwick
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
强制性开放获取政策： US National Science Foundation
Improved girth approximation in weighted undirected graphs
A Kadria, L Roditty, A Sidford, V Vassilevska Williams, U Zwick
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
强制性开放获取政策： US National Science Foundation
Dynamic ordered sets with approximate queries, approximate heaps and soft heaps
M Thorup, O Zamir, U Zwick
46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
强制性开放获取政策： Danish Council for Independent Research, Villum Foundation
Minimum-cost paths for electric cars
D Dorfman, H Kaplan, RE Tarjan, M Thorup, U Zwick
2024 Symposium on Simplicity in Algorithms (SOSA), 374-382, 2024
强制性开放获取政策： Villum Foundation
出版信息和资助信息由计算机程序自动确定