|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4036 occurrences of 1595 keywords
|
|
|
|
|
Results
Found 3592 publication records. Showing 3592 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Panagiotis Charalampopoulos, Tomasz Kociumaka, Philip Wellnitz |
Faster Approximate Pattern Matching: A Unified Approach.  |
FOCS  |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jason D. Hartline, Aleck C. Johnsen, Yingkai Li |
Benchmark Design and Prior-independent Optimization. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan Tidor, Yufei Zhao |
Testing linear-invariant properties. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin |
Adjacency Labelling for Planar Graphs (and Beyond). |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf |
Proximity Gaps for Reed-Solomon Codes. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai-Min Chung, Siyao Guo, Qipeng Liu 0001, Luowen Qian |
Tight Quantum Time-Space Tradeoffs for Function Inversion. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang |
Scheduling with Communication Delays via LP Hierarchies and Clustering. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, Ran Raz |
Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Young Kun-Ko, Omri Weinstein |
An Adaptive Step Toward the Multiphase Conjecture. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan O'Donnell, Xinyu Wu |
Explicit near-fully X-Ramanujan graphs. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein, Hung Le 0001 |
On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yakov Babichenko, Aviad Rubinstein |
Communication complexity of Nash equilibrium in potential games (extended abstract). |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ainesh Bakshi, Ilias Diakonikolas, Samuel B. Hopkins, Daniel Kane 0001, Sushrut Karmalkar, Pravesh K. Kothari |
Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Gartland, Daniel Lokshtanov |
Independent Set on $\mathrm{P}_{k}$-Free Graphs in Quasi-Polynomial Time. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman |
Nearly Optimal Pseudorandomness From Hardness. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Haotian Jiang, Tarun Kathuria, Yin Tat Lee, Swati Padmanabhan, Zhao Song 0002 |
A Faster Interior Point Method for Semidefinite Programming. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | David Gamarnik, Aukosh Jagannath, Alexander S. Wein |
Low-Degree Hardness of Random Optimization Problems. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nima Anari, Michal Derezinski |
Isotropy and Log-Concave Polynomials: Accelerated Sampling and High-Precision Counting of Matroid Bases. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Divesh Aggarwal, Maciej Obremski |
A constant rate non-malleable code in the split-state model. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Saket Saurabh 0001, Vaishali Surianarayanan |
A Parameterized Approximation Scheme for Min $k$-Cut. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Laura Mancinska, David E. Roberson |
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Daniel M. Kane |
Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Negev Shekel Nosatzki |
Edit Distance in Near-Linear Time: it's a Constant Factor. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas D. Ahle, Jakob Bæk Tejs Knudsen |
Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Roth, Johannes Schmitt 0002, Philip Wellnitz |
Counting Small Induced Subgraphs Satisfying Monotone Properties. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Sumegha Garg, David P. Woodruff |
The Coin Problem with Applications to Data Streams. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Édouard Bonnet, Eun Jung Kim 0002, Stéphan Thomassé, Rémi Watrigant |
Twin-width I: tractable FO model checking. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jason Li 0006, Debmalya Panigrahi |
Deterministic Min-cut in Poly-logarithmic Max-flows. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Drucker |
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Ron-Zewi, Ron D. Rothblum |
Local Proofs Approaching the Witness Length [Extended Abstract]. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel B. Hopkins, Tselil Schramm, Luca Trevisan |
Subexponential LPs Approximate Max-Cut. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Tarun Kathuria, Yang P. Liu, Aaron Sidford |
Unit Capacity Maxflow in Almost $O(m^{4/3})$ Time. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl |
Correlated Pseudorandom Functions from Variable-Density LPN. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Ilango |
Constant Depth Formula and Partial Function Versions of MCSP are Hard. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alkida Balliu, Sebastian Brandt 0002, Dennis Olivetti |
Distributed Lower Bounds for Ruling Sets. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Kociumaka, Barna Saha |
Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yeshwanth Cherapanamjeri, Sidhanth Mohanty, Morris Yau |
List Decodable Mean Estimation in Nearly Linear Time. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Grohe, Daniel Wiebking, Daniel Neuen |
Isomorphism Testing for Graphs Excluding Small Minors. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen |
Near-Optimal Decremental SSSP in Dense Weighted Digraphs. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | AmirMahdi Ahmadinejad, Jonathan A. Kelner, Jack Murtagh, John Peebles, Aaron Sidford, Salil P. Vadhan |
High-precision Estimation of Random Walks in Small Space. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Applebaum, Eliran Kachlon, Arpita Patra |
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Carmon, Yujia Jin, Aaron Sidford, Kevin Tian |
Coordinate Methods for Matrix Games. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Michael Kapralov, Navid Nouri, Paris Siminelakis |
Kernel Density Estimation through Density Constrained Near Neighbor Search. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak |
Deterministic Decremental Reachability, SCC, and Shortest Paths via Directed Expanders and Congestion Balancing. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mina Dalirrooyfard, Andrea Lincoln, Virginia Vassilevska Williams |
New Techniques for Proving Fine-Grained Average-Case Hardness. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Li Chen 0028, Gramoz Goranci, Monika Henzinger, Richard Peng, Thatchaphol Saranurak |
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandy Irani (eds.) |
61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020 |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Kempa, Tomasz Kociumaka |
Resolution of the Burrows-Wheeler Transform Conjecture. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Susanna F. de Rezende, Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere |
KRW Composition Theorems via Lifting. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Prerona Chatterjee, Mrinal Kumar 0001, C. Ramya, Ramprasad Saptharishi, Anamay Tengse |
On the Existence of Algebraically Natural Proofs. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang |
Symmetries, Graph Properties, and Quantum Speedups. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Ainesh Bakshi, Nadiia Chepurko, Rajesh Jayaram |
Testing Positive Semi-Definiteness via Random Submatrices. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mrinalkanti Ghosh, Fernando Granha Jeronimo, Chris Jones, Aaron Potechin, Goutham Rajendran |
Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
The complexity of approximating averages on bounded-degree graphs. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhiyi Huang 0002, Qiankun Zhang, Yuhao Zhang 0001 |
AdWords in a Panorama. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Fahrbach, Zhiyi Huang 0002, Runzhou Tao, Morteza Zadimoghaddam |
Edge-Weighted Online Bipartite Matching. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Josh Alman, Timothy Chu, Aaron Schild, Zhao Song 0002 |
Algorithms and Hardness for Linear Algebra on Geometric Graphs. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena |
Binary Interactive Error Resilience Beyond ${{}^{1}}\!/\!_{8}$ (or why $({{}^{1}}\!/\!_{2})^{3} > {{}^{1}}\!/\!_{8})$. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yu Chen 0039, Sanjeev Khanna, Ansh Nagda |
Near-linear Size Hypergraph Cut Sparsifiers. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-Yi Cai, Artem Govorov |
Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Erickson 0001, Ivor van der Hoog, Tillmann Miltzow |
Smoothing the gap between NP and ER. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas J. A. Harvey, Christopher Liaw, Edwin A. Perkins, Sikander Randhawa |
Optimal anytime regret for two experts. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael Pass, Muthuramakrishnan Venkitasubramaniam |
Is it Easier to Prove Theorems that are Guaranteed to be True? |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song 0002, Di Wang 0005 |
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhiyi Huang 0002, Zhihao Gavin Tang, Xiaowei Wu 0001, Yuhao Zhang 0001 |
Fully Online Matching II: Beating Ranking and Water-filling. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Lijie Chen 0001, Ron D. Rothblum, Roei Tell, Eylon Yogev |
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Karthekeyan Chandrasekaran, Chandra Chekuri |
Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Shalev Ben-David, Eric Blais |
A New Minimax Theorem for Randomized Algorithms (Extended Abstract). |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi-Jun Chang, Thatchaphol Saranurak |
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Bun, Roi Livni, Shay Moran |
An Equivalence Between Private Classification and Online Prediction. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Bryce Sandlund, Sebastian Wild |
Lazy Search Trees. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Vasilis Gkatzelis, Daniel Halpern 0002, Nisarg Shah 0001 |
Resolving the Optimal Metric Distortion Conjecture. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava, Madhur Tulsiani |
Unique Decoding of Explicit $\varepsilon$-balanced Codes Near the Gilbert-Varshamov Bound. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Lijie Chen 0001, Xin Lyu 0002, R. Ryan Williams |
Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Brakensiek, Ray Li, Bruce Spang |
Coded trace reconstruction in a constant number of traces. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan |
Towards Better Approximation of Graph Crossing Number. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernhard Haeupler, David Wajc, Goran Zuzic |
Network Coding Gaps for Completion Times of Multiple Unicasts. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyriakos Axiotis, Aleksander Madry, Adrian Vladu |
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Soheil Behnezhad, Mahsa Derakhshan |
Stochastic Weighted Matching: (Stochastic Weighted Matching: (1-ε) Approximation -\varepsilon$) Approximation. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Deepanshu Kush, Benjamin Rossman |
Tree-depth and the Formula Complexity of Subgraph Isomorphism. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Biswaroop Maiti, Rajmohan Rajaraman, David Stalfa, Zoya Svitkina, Aravindan Vijayaraghavan |
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yanyi Liu, Rafael Pass |
On One-way Functions and Kolmogorov Complexity. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikolai Karpov, Qin Zhang 0001, Yuan Zhou 0007 |
Collaborative Top Distribution Identifications with Limited Interaction (Extended Abstract). |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Noam Touitou |
Beyond Tree Embeddings - a Deterministic Framework for Network Design with Deadlines or Delay. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Visu Makam, Avi Wigderson |
Symbolic determinant identity testing (SDIT) is not a null cone problem; and the symmetries of algebraic varieties. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Braverman, Petros Drineas, Cameron Musco, Christopher Musco, Jalaj Upadhyay, David P. Woodruff, Samson Zhou |
Near Optimal Linear Algebra in the Online and Sliding Window Models. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Shai Evra, Tali Kaufman, Gilles Zémor |
Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, Muli Safra |
Towards a Proof of the Fourier-Entropy Conjecture? |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Modibo K. Camara, Jason D. Hartline, Aleck C. Johnsen |
Mechanisms for a No-Regret Agent: Beyond the Common Prior. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Shalev Ben-David, Eric Blais |
A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Dütting, Thomas Kesselheim, Brendan Lucier |
An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikkel Abrahamsen, Tillmann Miltzow, Nadja Seiferth |
Framework for ER-Completeness of Two-Dimensional Packing Problems. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Broadbent, Alex B. Grilo |
QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu |
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Golovnev, Gleb Posobin, Oded Regev 0001, Omri Weinstein |
Polynomial Data Structure Lower Bounds in the Group Model. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Jess Banks, Jorge Garza-Vargas, Archit Kulkarni, Nikhil Srivastava |
Pseudospectral Shattering, the Sign Function, and Diagonalization in Nearly Matrix Multiplication Time. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahdi Cheraghchi, Vasileios Nakos |
Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuchi Chawla 0001, Evangelia Gergatsouli, Yifeng Teng, Christos Tzamos, Ruimin Zhang |
Pandora's Box with Correlations: Learning and Approximation. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Vivek Madan, Aleksandar Nikolov, Mohit Singh, Uthaipon Tantipongpipat |
Maximizing Determinants under Matroid Constraints. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuichi Hirahara |
Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
Displaying result #401 - #500 of 3592 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license