The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "ITCS"( http://dblp.L3S.de/Venues/ITCS )

URL (DBLP): http://dblp.uni-trier.de/db/conf/innovations

Publication years (Num. hits)
2008-2012 (85) 2013 (163) 2014 (49) 2015 (46) 2016 (41) 2017 (62) 2018 (62) 2019 (67)
Publication types (Num. hits)
inproceedings(564) proceedings(11)
Venues (Conferences, Journals, ...)
ITCS(575)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 575 publication records. Showing 575 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi From Local to Robust Testing via Agreement Testing. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yuval Filmus, Ryan O'Donnell, Xinyu Wu A Log-Sobolev Inequality for the Multislice, with Applications. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Venkatesan Guruswami, Preetum Nakkiran, Madhu Sudan Algorithmic Polarization for Hidden Markov Models. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan 0001 A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Chi-Ning Chou, Kai-Min Chung, Chi-Jen Lu On the Algorithmic Power of Spiking Neural Networks. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, Amir Yehudayoff On the Communication Complexity of Key-Agreement Protocols. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Igor Carboni Oliveira, Rahul Santhanam, Roei Tell Expander-Based Cryptography Meets Natural Proofs. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Wei Chen 0013, Shang-Hua Teng, Hanrui Zhang Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Irit Dinur, Oded Goldreich 0001, Tom Gur Every Set in P Is Strongly Testable Under a Suitable Encoding. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Aaron Schild A Schur Complement Cheeger Inequality. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Anindya De, Philip M. Long, Rocco A. Servedio Density Estimation for Shift-Invariant Multidimensional Distributions. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nick Arnosti, S. Matthew Weinberg Bitcoin: A Natural Oligopoly. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sumegha Garg, Jon Schneider The Space Complexity of Mirror Games. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, William S. Zwicker Almost Envy-Free Allocations with Connected Bundles. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Boaz Barak, Pravesh K. Kothari, David Steurer Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1André Chailloux A Note on the Quantum Query Complexity of Permutation Symmetric Functions. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Krzysztof Pietrzak Proofs of Catalytic Space. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Aaron Potechin Sum of Squares Lower Bounds from Symmetry and a Good Story. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Krzysztof Pietrzak Simple Verifiable Delay Functions. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Timothy M. Chan, Sariel Har-Peled, Mitchell Jones On Locality-Sensitive Orderings and Their Applications. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Amit Levi, Erik Waingarten Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1 Front Matter, Table of Contents, Preface, Conference Organization. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Adam Bouland, Bill Fefferman, Chinmay Nirkhe, Umesh V. Vazirani "Quantum Supremacy" and the Complexity of Random Circuit Sampling. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Deeparnab Chakrabarty, C. Seshadhri Adaptive Boolean Monotonicity Testing in Total Influence Time. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Elette Boyle, Rio LaVigne, Vinod Vaikuntanathan Adversarially Robust Property-Preserving Hash Functions. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Constantinos Daskalakis, Ioannis Panageas Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Cynthia Dwork, Christina Ilvento Fairness Under Composition. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shipra Agrawal 0001, Mohammad Shadravan, Cliff Stein Submodular Secretary Problem with Shortlists. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao Torus Polynomials: An Algebraic Approach to ACC Lower Bounds. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dorit Aharonov, Leo Zhou Hamiltonian Sparsification and Gap-Simulation. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ce Jin Simulating Random Walks on Graphs in the Streaming Model. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ravi Kumar 0001, Manish Purohit, Aaron Schild, Zoya Svitkina, Erik Vee Semi-Online Bipartite Matching. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benny Applebaum, Prashant Nalini Vasudevan Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane, Richard Ryan Williams The Orthogonal Vectors Conjecture for Branching Programs and Formulas. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Christos H. Papadimitriou, Santosh S. Vempala Random Projection in the Brain and Computation with Assemblies of Neurons. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sofya Raskhodnikova, Noga Ron-Zewi, Nithin M. Varma Erasures vs. Errors in Local Decoding and Property Testing. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, Huaxiong Wang Secret Sharing with Binary Shares. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yan Jin, Elchanan Mossel, Govind Ramnarayan Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sepehr Assadi, Michael Kapralov, Sanjeev Khanna A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Markus Bläser, Gorav Jindal On the Complexity of Symmetric Polynomials. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Adi Rosén, Florent Urrutia A New Approach to Multi-Party Peer-to-Peer Communication Complexity. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Anna Gál, Avishay Tal, Adrian Trejo Nuñez Cubic Formula Size Lower Bounds Based on Compositions with Majority. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zachary Chase, Siddharth Prasad Learning Time Dependent Choice. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jingcheng Liu 0001, Alistair Sinclair, Piyush Srivastava Fisher Zeros and Correlation Decay in the Ising Model. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eli Ben-Sasson, Eden Saig The Complexity of User Retention. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dylan M. McKay, Richard Ryan Williams Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lijie Chen, Ruosong Wang Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Omri Ben-Eliezer Testing Local Properties of Arrays. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alessandro Chiesa, Peter Manohar, Igor Shinkar Probabilistic Checking Against Non-Signaling Strategies from Linearity Testing. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alexandr Andoni, Robert Krauthgamer, Yosef Pogrow On Solving Linear Systems in Sublinear Time. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mika Göös, Pritish Kamath, Robert Robere, Dmitry Sokolov 0001 Adventures in Monotone Complexity and TFNP. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Adam Bene Watts, Aram Wettroth Harrow, Gurtej Kanwar, Anand Natarajan Algorithms, Bounds, and Strategies for Entangled XOR Games. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Klaus Jansen, Lars Rohwedder On Integer Programming and Convolution. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron The Subgraph Testing Model. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Linus Hamilton, Ankur Moitra The Paulsen Problem Made Simple. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, Avishay Tal Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thibaut Horel, Sunoo Park, Silas Richelson, Vinod Vaikuntanathan How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shaddin Dughmi, David Kempe 0001, Ruixin Qiang Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pravesh K. Kothari, Ryan O'Donnell, Tselil Schramm SOS Lower Bounds with Hard Constraints: Think Global, Act Local. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Troy Lee, Maharshi Ray, Miklos Santha Strategies for Quantum Races. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nguyen Kim Thang Game Efficiency Through Linear Programming Duality. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Merav Parter, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee Local Computation Algorithms for Spanners. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Per Austrin, Petteri Kaski, Kaie Kubjas Tensor Network Complexity of Multilinear Maps. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Karthik C. S., Pasin Manurangsi On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nati Linial, Toniann Pitassi, Adi Shraibman On the Communication Complexity of High-Dimensional Permutations. Search on Bibsonomy ITCS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mark Braverman, Anat Ganor, Gillat Kol, Ran Raz A Candidate for a Strong Separation of Information and Communication. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yuqing Kong, Grant Schoenebeck Equilibrium Selection in Information Elicitation without Verification via Information Monotonicity. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Ankit Garg, Rafael Mendes de Oliveira, Michael Walter, Avi Wigderson Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha Edge Estimation with Independent Set Oracles. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Srikanth Srinivasan 0001, Madhu Sudan Local Decoding and Testing of Polynomials over Grids. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Avrim Blum (eds.) 10th Innovations in Theoretical Computer Science Conference, ITCS 2019, January 10-12, 2019, San Diego, California, USA Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  BibTeX  RDF
1Eric Allender, Joshua A. Grochow, Dieter van Melkebeek, Cristopher Moore, Andrew Morgan Minimum Circuit Size, Graph Isomorphism, and Related Problems. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Klim Efremenko, Ankit Garg, Rafael Mendes de Oliveira, Avi Wigderson Barriers for Rank Methods in Arithmetic Complexity. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Guy N. Rothblum Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Itay Berman, Ron D. Rothblum, Vinod Vaikuntanathan Zero-Knowledge Proofs of Proximity. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yishay Mansour, Aleksandrs Slivkins, Zhiwei Steven Wu Competing Bandits: Learning Under Competition. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Amir Abboud, Aviad Rubinstein Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alessandro Chiesa, Tom Gur Proofs of Proximity for Distribution Testing. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paul W. Goldberg, Christos H. Papadimitriou Towards a Unified Complexity Theory of Total Functions. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martin Groß 0001, Anupam Gupta, Amit Kumar 0001, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt 0001, José Verschae A Local-Search Algorithm for Steiner Forest. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yuqing Kong, Grant Schoenebeck Optimizing Bayesian Information Revelation Strategy in Prediction Markets: the Alice Bob Alice Case. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Josh Alman, Virginia Vassilevska Williams Further Limitations of the Known Approaches for Matrix Multiplication. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Georgios Piliouras, Leonard J. Schulman Learning Dynamics and the Co-Evolution of Competing Sexual Species. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rafael M. Frongillo, Bo Waggoner An Axiomatic Study of Scoring Rule Markets. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dana Moshkovitz, Michal Moshkovitz Entropy Samplers and Strong Generic Lower Bounds For Space Bounded Learning. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Ben-Or, Lior Eldar A Quasi-Random Approach to Matrix Spectral Analysis. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jacob Steinhardt, Moses Charikar, Gregory Valiant Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere Stabbing Planes. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner Scheduling with Explorable Uncertainty. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Greg Yang A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bernard Chazelle Toward a Theory of Markov Influence Systems and their Renormalization. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cameron Musco, Praneeth Netrapalli, Aaron Sidford, Shashanka Ubaru, David P. Woodruff Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Qingqing Huang 0001, Sham M. Kakade, Weihao Kong, Gregory Valiant Recovering Structured Probability Matrices. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aditya Bhaskara, Silvio Lattanzi Non-Negative Sparse Regression and Column Subset Selection with L1 Error. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lucas Boczkowski, Ofer Feinerman, Amos Korman, Emanuele Natale Limits for Rumor Spreading in Stochastic Populations. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tom Gur, Govind Ramnarayan, Ron D. Rothblum Relaxed Locally Correctable Codes. Search on Bibsonomy ITCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 575 (100 per page; Change: )
Pages: [1][2][3][4][5][6][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license