| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | George Karakostas, Stavros G. Kolliopoulos |
Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines.  |
APPROX/RANDOM  |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Noah G. Singer |
Oblivious Algorithms for the Max-kAND Problem. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Tsun Ming Cheung, Krishnamoorthy Dinesh 0001, John C. S. Lui |
Classical Simulation of One-Query Quantum Distinguishers. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich |
Synergy Between Circuit Obfuscation and Circuit Minimization. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou |
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark de Berg, Arpan Sadhukhan, Frits C. R. Spieksma |
Stable Approximation Algorithms for Dominating Set and Independent Set. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Emin Karayel |
An Embarrassingly Parallel Optimal-Space Cardinality Estimation Algorithm. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Anita Dürr, Nicolas El Maalouly, Lasse Wulf |
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Karthekeyan Chandrasekaran, Weihang Wang 0002 |
Approximating Submodular k-Partition via Principal Partition Sequence. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Prashanth Amireddy, Srikanth Srinivasan 0001, Madhu Sudan 0001 |
Low-Degree Testing over Grids. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Chin Ho Lee, Edward Pyne, Salil P. Vadhan |
On the Power of Regular and Permutation Branching Programs. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Danish Kashaev, Guido Schäfer |
Round and Bipartize for Vertex Cover Approximation. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Cook, Dana Moshkovitz |
Tighter MA/1 Circuit Lower Bounds from Verifier Efficient PCPs for PSPACE. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty 0001, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh |
On the Composition of Randomized Query Complexity and Approximate Degree. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Xi Chen 0001, Yaonan Jin, Tim Randolph 0001, Rocco A. Servedio |
Subset Sum in Time 2n/2 / poly(n). |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Matej Lieskovský, Jirí Sgall, Andreas Emil Feldmann |
Approximation Algorithms and Lower Bounds for Graph Burning. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
Superpolynomial Lower Bounds for Learning Monotone Classes. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova |
Sampling from the Random Cluster Model on Random Regular Graphs at All Temperatures via Glauber Dynamics. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Jacob Gray, Saachi Mutreja, Harsha Tirumala, Pengxiang Wang 0002 |
Robustness for Space-Bounded Statistical Zero Knowledge. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Jane Gao, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Maurice Rolvien |
The Full Rank Condition for Sparse Random Matrices. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikrant Ashvinkumar, Sepehr Assadi, Chengyuan Deng, Jie Gao 0001, Chen Wang 0027 |
Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Roy Gotlib, Tali Kaufman |
Fine Grained Analysis of High Dimensional Random Walks. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Eden Chlamtác, Yury Makarychev, Ali Vakilian |
Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Quanquan C. Liu, Yiduo Ke, Samir Khuller |
Scalable Auction Algorithms for Bipartite Maximum Matching Problems. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Morteza Monemizadeh |
Facility Location in the Sublinear Geometric Model. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Kalen Patton, Matteo Russo, Sahil Singla 0001 |
Submodular Norms with Applications To Online Facility Location and Stochastic Probing. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Karthik Gajulapalli, Alexander Golovnev, Satyajeet Nagargoje, Sidhant Saraogi |
Range Avoidance for Constant Depth Circuits: Hardness and Algorithms. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Renato Ferreira Pinto Jr. |
Directed Poincaré Inequalities and L¹ Monotonicity Testing of Lipschitz Functions. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek |
Bias Reduction for Sum Estimation. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Lap Chi Lau, Robert Wang 0004, Hong Zhou 0001 |
Experimental Design for Any p-Norm. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley |
Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Zachary Friggstad, Ramin Mousavi |
A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Abboud, MohammadHossein Bateni, Vincent Cohen-Addad, Karthik C. S., Saeed Seddighin |
On Complexity of 1-Center in Various Metrics. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Shilun Li |
A Deterministic Construction of a Large Distance Code from the Wozencraft Ensemble. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Kent Quanrud |
Independent Sets in Elimination Graphs with a Submodular Objective. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yahli Hecht, Dor Minzer, Muli Safra |
NP-Hardness of Almost Coloring Almost 3-Colorable Graphs. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamesh Munagala, Govind S. Sankar, Erin Taylor 0002 |
Probabilistic Metric Embedding via Metric Labeling. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Ayyadevara, Nikhil Bansal 0001, Milind Prabhu |
On Minimizing Generalized Makespan on Unrelated Machines. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Anand, Andreas Göbel 0001, Marcus Pappik, Will Perkins 0001 |
Perfect Sampling for Hard Spheres from Strong Spatial Mixing. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Blanca, Xusheng Zhang |
Rapid Mixing of Global Markov Chains via Spectral Independence: The Unbounded Degree Case. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos Ristache |
Testing Connectedness of Images. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilan Doron Arad, Ariel Kulik, Hadas Shachnai |
An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Megow, Adam D. Smith (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023, September 11-13, 2023, Atlanta, Georgia, USA |
APPROX/RANDOM |
2023 |
DBLP BibTeX RDF |
|
| 1 | Lindsey Deryckere, Seeun William Umboh |
Online Matching with Set and Concave Delays. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber 0001, Emo Welzl |
On Connectivity in Random Graph Models with Limited Dependencies. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepideh Mahabadi, Shyam Narayanan |
Improved Diversity Maximization Algorithms for Matching and Pseudoforest. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuchi Chawla 0001, Evangelia Gergatsouli, Jeremy McMahan, Christos Tzamos |
Approximating Pandora's Box with Correlations. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Swastik Kopparty, Vishvajeet N |
Extracting Mergers and Projections of Partitions. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ishan Bansal, Joe Cheriyan, Logan Grout, Sharat Ibrahimpur |
Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Grigorescu, Nithish Kumar, Young-San Lin |
Approximation Algorithms for Directed Weighted Spanners. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Huck Bennett, Chris Peikert |
Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta 0001, Amit Kumar 0001, Debmalya Panigrahi |
Efficient Algorithms and Hardness Results for the Weighted k-Server Problem. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Höhne, Rob van Stee |
A 10/7-Approximation for Discrete Bamboo Garden Trimming and Continuous Trimming on Star Graphs. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, Michael Kapralov, Huacheng Yu |
On Constructing Spanners from Random Gaussian Projections. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz |
The (Im)possibility of Simple Search-To-Decision Reductions for Approximation Problems. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Meghal Gupta, Rachel Yun Zhang |
Interactive Error Correcting Codes: New Constructions and Impossibility Bounds. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Tanvi Bajpai, Chandra Chekuri |
Bicriteria Approximation Algorithms for Priority Matroid Median. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Filmus, Itai Leigh, Artur Riazanov, Dmitry Sokolov 0001 |
Sampling and Certifying Symmetric Functions. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Lior Gishboliner, Nick Kushnir, Asaf Shapira |
Testing Versus Estimation of Graph Properties, Revisited. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Fernando Granha Jeronimo |
Fast Decoding of Explicit Almost Optimal ε-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPs. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorna Abdolazimi, Kasper Lindberg, Shayan Oveis Gharan |
On Optimization and Counting of Non-Broken Bases of Matroids. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Braverman, Joel Manning, Zhiwei Steven Wu, Samson Zhou |
Private Data Stream Analysis for Universal Symmetric Norm Estimation. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Charilaos Efthymiou 0001, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda |
Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Cook, Ron D. Rothblum |
Efficient Interactive Proofs for Non-Deterministic Bounded Space. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Rubi Arviv, Lily Chung, Reut Levi, Edward Pyne |
Improved Local Computation Algorithms for Constructing Spanners. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruben Becker, Arnaud Casteigts, Pierluigi Crescenzi, Bojana Kodric, Malte Renken, Michael Raskin, Viktor Zamaraev |
Giant Components in Random Temporal Graphs. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Arijit Bishnu, Arijit Ghosh, Gopinath Mishra |
On the Complexity of Triangle Counting Using Emptiness Queries. |
APPROX/RANDOM |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Xin Lyu, Xiuhan Wang |
Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, David Mass |
Double Balanced Sets in High Dimensional Expanders. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Blanca, Reza Gheissari |
Sampling from Potts on Random Graphs of Unbounded Degree via Random-Cluster Dynamics. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksa Stankovic |
Some Results on Approximability of Minimum Sum Vertex Cover. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhao Song 0002, Ruizhe Zhang 0001 |
Hyperbolic Concentration, Anti-Concentration, and Discrepancy. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal 0001, Aditi Laddha, Santosh S. Vempala |
A Unified Approach to Discrepancy Minimization. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Pu Gao, Calum MacRury, Pawel Pralat |
A Fully Adaptive Strategy for Hamiltonian Cycles in the Semi-Random Graph Process. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Chhaya Trehan |
(1+ε)-Approximate Shortest Paths in Dynamic Streams. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Blanca, Sarah Cannon, Will Perkins 0001 |
Fast and Perfect Sampling of Subgraphs and Polymer Systems. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Izhar Oppenheim |
High Dimensional Expansion Implies Amplified Local Testability. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif |
A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Bienkowski, Martin Böhm 0001, Jaroslaw Byrka, Jan Marcinkowski |
Online Facility Location with Linear Delay. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Roy Schwartz 0002, Roded Zats |
Fair Correlation Clustering in General Graphs. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Karliner, Amnon Ta-Shma |
Improved Local Testing for Multiplicity Codes. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, Slobodan Mitrovic |
Massively Parallel Algorithms for Small Subgraph Counting. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sepehr Assadi, Hoai-An Nguyen |
Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Gabrys, Venkatesan Guruswami, João Ribeiro 0002, Ke Wu 0001 |
Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shichuan Deng, Qianfan Zhang 0002 |
Ordered k-Median with Outliers. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mika Göös, Siddhartha Jain 0002 |
Communication Complexity of Collision. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hridesh Kedia, Shunhao Oh, Dana Randall |
Local Stochastic Algorithms for Alignment in Self-Organizing Particle Systems. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Skorski |
Tight Chernoff-Like Bounds Under Limited Independence. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar |
Bypassing the XOR Trick: Stronger Certificates for Hypergraph Clique Number. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Iwan M. Duursma, Ryan Gabrys, Venkatesan Guruswami, Ting-Chun Lin, Hsin-Po Wang 0001 |
Accelerating Polarization via Alphabet Extension. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi Li 0002, Honghao Lin, David P. Woodruff, Yuheng Zhang |
Streaming Algorithms with Large Approximation Factors. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yahel Manor, Or Meir |
Lifting with Inner Functions of Polynomial Discrepancy. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Hamed Hatami, Pooya Hatami, William Pires, Ran Tao, Rosie Zhao |
Lower Bound Methods for Sign-Rank and Their Limitations. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcos Kiwi, Markus Schepers, John Sylvester 0001 |
Cover and Hitting Times of Hyperbolic Random Graphs. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vishwas Bhargava, Ankit Garg, Neeraj Kayal, Chandan Saha 0001 |
Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Chin Ho Lee, Edward Pyne, Salil P. Vadhan |
Fourier Growth of Regular Branching Programs. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Esperet, Nathaniel Harms, Andrey Kupavskii |
Sketching Distances in Monotone Graph Classes. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Suprovat Ghoshal, Anand Louis |
Approximating CSPs with Outliers. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Suprovat Ghoshal |
The Biased Homogeneous r-Lin Problem. |
APPROX/RANDOM |
2022 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license