default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Colloquium on Computational Complexity, 2015
Volume TR15, 2015
- Nir Bitansky, Omer Paneth, Alon Rosen:
On the Cryptographic Hardness of Finding a Nash Equilibrium. - Mark Braverman, Rotem Oshman:
The Communication Complexity of Number-In-Hand Set Disjointness with No Promise. - Oded Goldreich, Emanuele Viola, Avi Wigderson:
On Randomness Extraction in AC0. - Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan
:
On the Complexity of Noncommutative Polynomial Factorization. - Chin Ho Lee, Emanuele Viola:
Some limitations of the sum of small-bias distributions. - Nader H. Bshouty:
Dense Testers: Almost Linear Time and Locally Explicit Constructions. - Jonah Brown-Cohen, Prasad Raghavendra:
Combinatorial Optimization Algorithms via Polymorphisms. - Igor Carboni Oliveira, Siyao Guo, Tal Malkin, Alon Rosen:
The Power of Negations in Cryptography. - Aloni Cohen, Shafi Goldwasser, Vinod Vaikuntanathan:
Aggregate Pseudorandom Functions and Connections to Learning. - Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
Security Levels in Steganography - Insecurity does not Imply Detectability. - Subhash Khot, Dor Minzer, Muli Safra:
On Monotonicity Testing and Boolean Isoperimetric type Theorems. - Mika Göös:
Lower Bounds for Clique vs. Independent Set. - Subhash Khot, Igor Shinkar:
On Hardness of Approximating the Parameterized Clique Problem. - Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable Communication over Highly Connected Noisy Networks. - Neeraj Kayal, Chandan Saha:
Multi-k-ic depth three circuit lower bound. - Diptarka Chakraborty, Raghunath Tewari:
An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs. - Bruno Bauwens, Marius Zimand:
Linear list-approximation for short programs (or the power of a few random bits). - Eric Allender, Ian Mertz:
Complexity of Regular Functions. - Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira:
Constructing Near Spanning Trees with Few Local Inspections. - Michael Viderman:
Explicit Strong LTCs with inverse poly-log rate and constant soundness. - Stephen A. Fenner, Daniel Grier, Jochen Messner, Luke Schaeffer, Thomas Thierauf:
Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games. - Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower bounds for non-commutative skew circuits. - Mark Braverman, Jon Schneider:
Information complexity is computable. - Oded Goldreich, Tom Gur, Ron Rothblum:
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs. - Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff:
Teaching and compressing for low VC-dimension. - Siyao Guo, Ilan Komargodski:
Negation-Limited Formulas. - Benny Applebaum:
Cryptographic Hardness of Random Local Functions - Survey. - Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland:
Relative Discrepancy does not separate Information and Communication Complexity. - Stanislav Zák:
Inherent logic and complexity. - Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
AC0 \circ MOD2 lower bounds for the Boolean Inner Product. - Marco Molinaro, David P. Woodruff, Grigory Yaroslavtsev:
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity. - Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
Graph Isomorphism, Color Refinement, and Compactness. - Alexander A. Razborov:
An Ultimate Trade-Off in Propositional Proof Complexity. - Xin Li:
Three-Source Extractors for Polylogarithmic Min-Entropy. - K. S. Sunil, Balagopal Komarath, Jayalal Sarma:
Comparator Circuits over Finite Bounded Posets. - David Gajser:
Verifying whether One-Tape Turing Machines Run in Linear Time. - Arnab Bhattacharyya, Palash Dey:
Sample Complexity for Winner Prediction in Elections. - Gil Cohen:
Local Correlation Breakers and Applications to Three-Source Extractors and Mergers. - Anup Rao, Makrand Sinha:
On Parallelizing Streaming Algorithms. - Shay Moran, Amir Yehudayoff:
Proper PAC learning is compressing. - Mark Bun, Justin Thaler:
Dual Polynomials for Collision and Element Distinctness. - Ilya Volkovich:
Computations beyond Exponentiation Gates and Applications. - Alan Guo, Elad Haramaty, Madhu Sudan:
Robust testing of lifted codes with applications to low-degree testing. - Timothy Gowers, Emanuele Viola:
The communication complexity of interleaved group products. - Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Minimizing Locality of One-Way Functions via Semi-Private Randomized Encodings. - Talya Eden, Amit Levi, Dana Ron:
Approximately Counting Triangles in Sublinear Time. - Swastik Kopparty, Mrinal Kumar, Michael E. Saks:
Efficient indexing of necklaces and irreducible polynomials over finite fields. - Kamil Khadiev:
Width Hierarchy for k-OBDD of Small Width. - Mika Göös, Toniann Pitassi, Thomas Watson:
The Landscape of Communication Complexity Classes. - Mika Göös, Toniann Pitassi, Thomas Watson:
Deterministic Communication vs. Partition Number. - Benny Applebaum, Sergei Artemenko, Ronen Shaltiel, Guang Yang:
Incompressible Functions, Relative-Error Extractors, and the Power of Nondeterminsitic Reductions. - Partha Mukhopadhyay:
Depth-4 Identity Testing and Noether's Normalization Lemma. - Massimo Lauria, Jakob Nordström:
Tight Size-Degree Bounds for Sums-of-Squares Proofs. - Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein:
Welfare Maximization with Limited Interaction. - Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao:
How to Compress Asymmetric Communication. - Sanjam Garg, Steve Lu, Rafail Ostrovsky:
Black-Box Garbled RAM. - Anup Rao, Makrand Sinha:
Simplified Separation of Information and Communication. - Peng Cui:
Strengthened Hardness for Approximating Minimum Unique Game and Small Set Expansion. - Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Feasible Interpolation for QBF Resolution Calculi. - Omri Weinstein:
Information Complexity and the Quest for Interactive Compression. - Benny Applebaum, Jonathan Avron, Christina Brzuska:
Arithmetic Cryptography. - Sangxia Huang:
2(\log N)1/4-o(1) Hardness for Hypergraph Coloring. - Clément L. Canonne:
A Survey on Distribution Testing: Your Data is Big. But is it Blue? - Ilan Komargodski, Pravesh Kothari, Madhu Sudan:
Communication with Contextual Uncertainty. - Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan:
An average-case depth hierarchy theorem for Boolean circuits. - Scott Aaronson, Daniel Grier, Luke Schaeffer:
The Classification of Reversible Bit Operations. - Pavel Hrubes:
On hardness of multilinearization, and VNP completeness in characteristics two. - Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf:
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. - Amey Bhangale, Ramprasad Saptharishi, Girish Varma, Rakesh Venkat:
On Fortification of General Games. - Himanshu Tyagi, Shaileshh Bojja Venkatakrishnan, Pramod Viswanath, Shun Watanabe:
Information Complexity Density and Simulation of Protocols. - Mrinal Kumar, Shubhangi Saraf:
Sums of products of polynomials in few variables : lower bounds and polynomial identity testing. - Roei Tell:
On Being Far from Far and on Dual Problems in Property Testing. - Neeraj Kayal, Chandan Saha:
Lower Bounds for Sums of Products of Low arity Polynomials. - Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein:
ETH Hardness for Densest-k-Subgraph with Perfect Completeness. - Eshan Chattopadhyay, Vipul Goyal, Xin Li:
Non-Malleable Extractors and Codes, with their Many Tampered Extensions. - Mahdi Cheraghchi, Piotr Indyk:
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. - Arnab Bhattacharyya, Abhishek Bhowmick:
Using higher-order Fourier analysis over general fields. - Mladen Miksa, Jakob Nordström:
A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds. - Oded Goldreich, Avishay Tal:
Matrix Rigidity of Random Toeplitz Matrices. - Noam Ta-Shma:
A simple proof of the Isolation Lemma. - Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-optimal bounds on bounded-round quantum communication complexity of disjointness. - Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the random assignment on constraint satisfaction problems of bounded degree. - Omri Weinstein, David P. Woodruff:
The Simultaneous Communication of Disjointness with Applications to Data Streams. - Or Ordentlich, Ofer Shayevitz, Omri Weinstein:
Dictatorship is the Most Informative Balanced Function at the Extremes. - Irit Dinur, Prahladh Harsha, Guy Kindler:
Polynomially Low Error PCPs with polyloglogn Queries via Modular Composition. - Jop Briët:
On Embeddings of ℓ1k from Locally Decodable Codes. - Badih Ghazi, Pritish Kamath, Madhu Sudan:
Communication Complexity of Permutation-Invariant Functions. - Anat Ganor, Gillat Kol, Ran Raz:
Exponential Separation of Communication and External Information. - Eldar Fischer, Oded Lachish, Yadu Vasudev:
Trading query complexity for sample-based testing and multi-testing scalability}. - Alexander Kozachinsky:
On Slepian-Wolf Theorem with Interaction. - Joshua Brody, Mario Sánchez:
Dependent Random Graphs and Multiparty Pointer Jumping. - Yael Tauman Kalai, Ilan Komargodski:
Compressing Communication in Distributed Protocols. - Aviad Rubinstein:
Inapproximability of Nash Equilibrium. - Eli Ben-Sasson, Iddo Bentov, Ivan Bjerre Damgård, Yuval Ishai, Noga Ron-Zewi:
On Public Key Encryption from Noisy Codewords. - Gil Cohen:
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs. - Abhishek Bhowmick, Shachar Lovett:
Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory. - Marek Karpinski:
Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies. - Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs:
Separations in Query Complexity Based on Pointer Functions. - Ruiwen Chen:
Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases. - Bireswar Das, Patrick Scharpfenecker, Jacobo Torán:
Succinct Encodings of Graph Isomorphism. - Patrick Scharpfenecker:
On the structure of Solution-Graphs for Boolean Formulas. - (Withdrawn) An O(n0.4732) upper bound on the complexity of the GKS communication game.
- Nathanaël François, Frédéric Magniez, Olivier Serre, Michel de Rougemont:
Streaming Property Testing of Visibly Pushdown Languages. - Venkatesan Guruswami, Euiwoong Lee:
Towards a Characterization of Approximation Resistance for Symmetric CSPs. - Itay Berman, Iftach Haitner, Aris Tentes:
Coin Flipping of Any Constant Bias Implies One-Way Functions. - Sagnik Mukhopadhyay, Swagato Sanyal:
Towards Better Separation between Deterministic and Randomized Query Complexity. - Shalev Ben-David:
A Super-Grover Separation Between Randomized and Quantum Query Complexities. - Mrinal Kumar, Ramprasad Saptharishi:
An exponential lower bound for homogeneous depth-5 circuits over finite fields. - Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf:
High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity. - Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký:
Low Distortion Embedding from Edit to Hamming Distance using Coupling. - Ruiwen Chen, Rahul Santhanam:
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP. - Amit Chakrabarti, Anthony Wirth:
Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover. - Avishay Tal:
#SAT Algorithms from Shrinkage. - Ilya Volkovich:
A Guide to Learning Arithmetic Circuits. - Joshua Brakensiek, Venkatesan Guruswami, Samuel Zbarsky:
Efficient Low-Redundancy Codes for Correcting Multiple Deletions. - Boris Bukh, Venkatesan Guruswami:
An improved bound on the fraction of correctable deletions. - Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The shifted partial derivative complexity of Elementary Symmetric Polynomials. - Eshan Chattopadhyay, David Zuckerman:
Explicit Two-Source Extractors and Resilient Functions. - Xiaotie Deng, Zhe Feng, Zhengyang Liu, Qi Qi:
Understanding PPA-Completeness. - Xin Li:
Extractors for Affine Sources with Polylogarithmic Entropy. - Shiteng Chen, Periklis A. Papakonstantinou:
Correlation lower bounds from correlation upper bounds. - Xi Chen, Igor Carboni Oliveira, Rocco A. Servedio:
Addition is exponentially harder than counting for shallow monotone circuits. - Vikraman Arvind, Pushkar S. Joglekar, Raja S:
Noncommutative Valiant's Classes: Structure and Complete Problems. - Xin Li:
Improved Constructions of Two-Source Extractors. - Jacob Steinhardt, Gregory Valiant, Stefan Wager:
Memory, Communication, and Statistical Queries. - Stasys Jukna, Georg Schnitger:
On the Optimality of Bellman-Ford-Moore Shortest Path Algorithm. - Roee David, Elazar Goldenberg, Robert Krauthgamer:
Local Reconstruction of Low-Rank Matrices and Subspaces. - Alex Samorodnitsky:
On the entropy of a noisy function. - Ronald de Haan:
An Overview of Non-Uniform Parameterized Complexity. - Parikshit Gopalan, Noam Nisan, Rocco A. Servedio, Kunal Talwar, Avi Wigderson:
Smooth Boolean functions are easy: efficient algorithms for low-sensitivity functions. - Daniel Reichman, Igor Shinkar:
On Percolation and NP-Hardness. - Olaf Beyersdorff, Ilario Bonacina, Leroy Chew:
Lower bounds: from circuits to QBF proof systems. - Fu Li, Iddo Tzameret, Zhengyu Wang:
Characterizing Propositional Proofs as Non-Commutative Formulas. - Arnab Bhattacharyya, Palash Dey:
Fishing out Winners from Vote Streams. - Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom. - Mohammad Bavarian, Dmitry Gavinsky, Tsuyoshi Ito:
On the Role of Shared Randomness in Simultaneous Communication. - Michal Koucký:
Nonuniform catalytic space and the direct sum for space. - Eli Ben-Sasson, Gal Maor:
Lower bound for communication complexity with no public randomness. - Adam Case, Jack H. Lutz, Donald M. Stull:
Reachability Problems for Continuous Chemical Reaction Networks. - Pushkar S. Joglekar, N. R. Aravind:
On the expressive power of read-once determinants. - Srikanth Srinivasan:
A Compression Algorithm for AC0[⊕] circuits using Certifying Polynomials. - Benjamin Rossman:
The Average Sensitivity of Bounded-Depth Formulas. - Raghu Meka:
Explicit resilient functions matching Ajtai-Linial. - Eric Allender, Asa Goodwillie:
Arithmetic circuit classes over Zm. - Elette Boyle, Moni Naor:
Is There an Oblivious RAM Lower Bound? - Alexander A. Sherstov:
The Power of Asymmetry in Constant-Depth Circuits. - Marco Carmosino, Jiawei Gao, Russell Impagliazzo, Ivan Mihajlin, Ramamohan Paturi, Stefan Schneider:
Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility. - Mohammad Hajiabadi, Bruce M. Kapron:
Gambling, Computational Information, and Encryption Security. - Gaurav Sinha:
Reconstruction of ΣΠΣ(2) Circuits over Reals. - Eshan Chattopadhyay, David Zuckerman:
New Extractors for Interleaved Sources. - Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla:
Are Short Proofs Narrow? QBF Resolution is not Simple. - Tim Roughgarden:
Computing Equilibria: A Computational Complexity Perspective. - Neeraj Kayal, Vineet Nair, Chandan Saha:
Separation between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits. - Venkatesan Guruswami, Euiwoong Lee:
Nearly Optimal NP-Hardness of Unique Coverage. - Tim Roughgarden:
Communication Complexity (for Algorithm Designers). - Thomas O'Neil:
Representation-Independent Fixed Parameter Tractability for Vertex Cover and Weighted Monotone Satisfiability. - Ofer Grossman, Dana Moshkovitz:
Amplification and Derandomization Without Slowdown. - Juraj Hromkovic:
Why the Concept of Computational Complexity is Hard for Verifiable Mathematics. - Clément L. Canonne:
Are Few Bins Enough: Testing Histogram Distributions. - Chaoping Xing, Chen Yuan:
A new class of rank-metric codes and their list decoding beyond the unique decoding radius. - Eric Allender, Joshua A. Grochow, Cristopher Moore:
Graph Isomorphism and Circuit Size. - James Aisenberg, Maria Luisa Bonet, Sam Buss:
2-D Tucker is PPA complete. - Pavel Hrubes, Amir Yehudayoff:
On isoperimetric profiles and computational complexity. - Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Towards Optimal Deterministic Coding for Interactive Communication. - Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov:
A better-than-3n lower bound for the circuit complexity of an explicit function. - Mika Göös, T. S. Jayram:
A Composition Theorem for Conical Juntas. - Gillat Kol:
Interactive Compression for Product Distributions. - Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson:
Randomized Communication vs. Partition Number. - Alexander Golovnev, Alexander S. Kulikov:
Weighted gate elimination: Boolean dispersers for quadratic varieties imply improved circuit lower bounds. - Joshua A. Grochow:
Monotone projection lower bounds from extended formulation lower bounds. - Benny Applebaum, Shachar Lovett:
Algebraic Attacks against Random Local Functions and Their Countermeasures. - Martin Schwarz:
An exponential time upper bound for Quantum Merlin-Arthur games with unentangled provers. - Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Complexity of distributions and average-case hardness. - Scott Aaronson, Shalev Ben-David, Robin Kothari:
Separations in query complexity using cheat sheets. - Vikraman Arvind, Raja S:
Some Lower Bound Results for Set-Multilinear Arithmetic Computations. - Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
Bipartite Perfect Matching is in quasi-NC. - Eshan Chattopadhyay, Xin Li:
Extractors for Sumset Sources. - Divesh Aggarwal, Kaave Hosseini, Shachar Lovett:
Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification. - Bo Tang, Jiapeng Zhang:
Barriers to Black-Box Constructions of Traitor Tracing Systems. - Neeraj Kayal, Chandan Saha, Sébastien Tavenas:
On the size of homogeneous and of depth four formulas with low individual degree. - Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson:
Bounded Indistinguishability and the Complexity of Recovering Secrets. - Gil Cohen:
Non-Malleable Extractors - New Tools and Improved Constructions. - Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. - Arnab Bhattacharyya, Sivakanth Gopi:
Lower bounds for constant query affine-invariant LCCs and LTCs. - Benny Applebaum, Pavel Raykov:
On the Relationship between Statistical Zero-Knowledge and Statistical Randomized Encodings. - Nir Bitansky, Vinod Vaikuntanathan:
A Note on Perfect Correctness by Derandomization. - Daniel M. Kane, Ryan Williams:
Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits. - Shay Moran, Cyrus Rashtchian:
Shattered Sets and the Hilbert Function. - Esther Ezra, Shachar Lovett:
On the Beck-Fiala Conjecture for Random Set Systems. - Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan:
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. - Ruiwen Chen, Rahul Santhanam:
Satisfiability on Mixed Instances. - Arnab Bhattacharyya, Ameet Gadekar, Suprovat Ghoshal, Rishi Saket:
On the hardness of learning sparse parities. - Mrinal Kumar, Shubhangi Saraf:
Arithmetic circuits with locally low algebraic rank. - Robin Kothari:
Nearly optimal separations between communication (or query) complexity and partitions. - Andris Ambainis:
Polynomials, Quantum Query Complexity, and Grothendieck's Inequality. - Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Constant-rate coding for multiparty interactive communication is impossible. - Shuichi Hirahara, Osamu Watanabe:
Limits of Minimum Circuit Size Problem as Oracle. - Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan:
Relaxed partition bound is quadratically tight for product distributions. - Andris Ambainis:
Almost quadratic gap between partition complexity and query/communication complexity. - C. Ramya, B. V. Raghavendra Rao:
Limitations of sum of products of Read-Once Polynomials. - Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Building above read-once polynomials: identity testing and hardness of representation. - Scott Aaronson, Shalev Ben-David:
Sculpting Quantum Speedups. - Meena Mahajan, Anuj Tawari:
Sums of read-once formulas: How many summands suffice? - Emanuele Viola:
Quadratic maps are hard to sample. - Benny Applebaum, Pavel Raykov:
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back. - Ofer Grossman:
Finding Primitive Roots Pseudo-Deterministically. - Shafi Goldwasser, Ofer Grossman:
Perfect Bipartite Matching in Pseudo-Deterministic RNC. - Eli Ben-Sasson, Gal Maor:
On the information leakage of public-output protocols.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-02-06 22:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
