The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

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

Publication years (Num. hits)
1969 (32) 1970 (28) 1971 (24) 1972 (30) 1973 (31) 1974 (36) 1975 (32) 1976 (31) 1977 (32) 1978 (39) 1979 (38) 1980 (48) 1981 (44) 1982 (46) 1983 (55) 1984 (67) 1985 (54) 1986 (48) 1987 (51) 1988 (55) 1989 (57) 1990 (60) 1991 (59) 1992 (76) 1993 (87) 1994 (82) 1995 (79) 1996 (75) 1997 (80) 1998 (77) 1999 (87) 2000 (86) 2001 (87) 2002 (93) 2003 (81) 2004 (74) 2005 (86) 2006 (80) 2007 (79) 2008 (86) 2009 (80) 2010 (83) 2011 (85) 2012 (90) 2013 (101) 2014 (92) 2015 (94) 2016 (93) 2017 (111) 2018 (114) 2019 (114)
Publication types (Num. hits)
inproceedings(3398) proceedings(51)
Venues (Conferences, Journals, ...)
STOC(3449)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1771 occurrences of 757 keywords

Results
Found 3449 publication records. Showing 3449 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Thomas C. Bohdanowicz, Elizabeth Crosson, Chinmay Nirkhe, Henry Yuen Good approximate quantum LDPC codes from spacetime circuit Hamiltonians. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael B. Cohen, Yin Tat Lee, Zhao Song Solving linear programs in the current matrix multiplication time. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Adam Bene Watts, Robin Kothari, Luke Schaeffer, Avishay Tal Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yaonan Jin, Pinyan Lu, Qi Qi, Zhihao Gavin Tang, Tao Xiao Tight approximation ratio of anonymous pricing. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael Capalbo Explicit N-vertex graphs with maximum degree K and diameter [1+o(1)] logK-1 N for each K-1 a prime power. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Xi Chen, Erik Waingarten Testing unateness nearly optimally. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan 0001, Utkarsh Tripathi, S. Venkitesh A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1André Linhares, Chaitanya Swamy Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lijie Chen, Roei Tell Bootstrapping results for threshold circuits "just beyond" known lower bounds. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jakub Bulín, Andrei A. Krokhin, Jakub Oprsal Algebraic approach to promise constraint satisfaction. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Atul Singh Arora, Jérémie Roland, Stephan Weis Quantum weak coin flipping. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pascal Schweitzer, Daniel Wiebking A unifying method for the design of algorithms canonizing combinatorial objects. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Raghu Meka, Omer Reingold, Avishay Tal Pseudorandom generators for width-3 branching programs. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Nikhil S. Mande, Suhail Sherif The log-approximate-rank conjecture is false. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, Mark Sellke Competitively chasing convex bodies. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Huacheng Yu Optimal succinct rank data structure via approximate nonnegative tensor decomposition. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1András Gilyén, Yuan Su, Guang Hao Low, Nathan Wiebe Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Anastasios Sidiropoulos Polylogarithmic approximation for Euler genus on bounded degree graphs. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Amir Shpilka Sylvester-Gallai type theorems for quadratic polynomials. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh A universal sampling method for reconstructing signals with simple Fourier transforms. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alexander A. Sherstov, Pei Wu Near-optimal lower bounds on the threshold degree and sign-rank of AC0. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael A. Bender, Martin Farach-Colton, William Kuszmaul Achieving optimal backlog in multi-processor cup games. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Moses Charikar, Edith Cohen (eds.) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  BibTeX  RDF
1Anupam Gupta, Euiwoong Lee, Jason Li The number of minimum k-cuts: improving the Karger-Stein bound. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ankur Moitra, Alexander S. Wein Spectral methods from tensor networks. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sepehr Assadi, Yu Chen, Sanjeev Khanna Polynomial pass lower bounds for graph streaming algorithms. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mina Dalirrooyfard, Thuy Duong Vuong, Virginia Vassilevska Williams Graph pattern detection: hardness for all induced patterns and faster non-induced cycles. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen Decremental strongly-connected components and single-source reachability in near-linear time. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eric Balkanski, Aviad Rubinstein, Yaron Singer An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vishesh Jain, Frederic Koehler, Andrej Risteski Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Moses Charikar, Kirankumar Shiragur, Aaron Sidford Efficient profile maximum likelihood for universal symmetric property estimation. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alina Ene, Huy L. Nguyen, Adrian Vladu Submodular maximization with matroid and packing constraints in parallel. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Navin Goyal, Abhishek Shetty Non-Gaussian component analysis using entropy methods. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Joseph F. Fitzsimons, Zhengfeng Ji, Thomas Vidick, Henry Yuen Quantum proof systems for iterated exponential time, and beyond. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1David Durfee, Yu Gao, Gramoz Goranci, Richard Peng Fully dynamic spectral vertex sparsifiers and applications. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Scott Aaronson, Guy N. Rothblum Gentle measurement of quantum states and differential privacy. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael Kapralov, Dmitry Krachun An optimal space lower bound for approximating MAX-CUT. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sebastian Forster, Gramoz Goranci Dynamic low-stretch trees via dynamic low-diameter decompositions. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Aaron Potechin On the approximation resistance of balanced linear threshold functions. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Weiming Feng, Nisheeth K. Vishnoi, Yitong Yin Dynamic sampling from graphical models. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fabrizio Grandoni 0001, Bundit Laekhanukit, Shi Li O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Chandra Chekuri, Kent Quanrud Parallelizing greedy for submodular set function maximization in matroids and beyond. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tyler Helmuth, Will Perkins, Guus Regts Algorithmic Pirogov-Sinai theory. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dominik Kempa, Tomasz Kociumaka String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Noga Alon, Roi Livni, Maryanthe Malliaris, Shay Moran Private PAC learning implies finite Littlestone dimension. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shyam Narayanan, Jelani Nelson Optimal terminal dimensionality reduction in Euclidean space. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Amir Abboud, Raghavendra Addanki, Fabrizio Grandoni 0001, Debmalya Panigrahi, Barna Saha Dynamic set cover: improved algorithms and lower bounds. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Amir Yehudayoff Separating monotone VP and VNP. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jason Li, Merav Parter Planar diameter via metric compression. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Chenghao Guo, Zhiyi Huang, Xinzhi Zhang Settling the sample complexity of single-parameter revenue maximization. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann Almost optimal distance oracles for planar graphs. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ran Raz, Avishay Tal Oracle separation of BQP and PH. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sitan Chen, Ankur Moitra Beyond the low-degree algorithm: mixtures of subcubes and their applications. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs Fiat-Shamir: from practice to theory. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Neeraj Kayal, Chandan Saha 0001 Reconstruction of non-degenerate homogeneous depth three circuits. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hedyeh Beyhaghi, S. Matthew Weinberg Optimal (and benchmark-optimal) competition complexity for additive buyers over independent items. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rasmus Kyng, Richard Peng, Sushant Sachdeva, Di Wang Flows in almost linear time via adaptive preconditioning. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Justin Holmgren, Lisa Yang The parallel repetition of non-signaling games: counterexamples and dichotomy. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bernhard Haeupler, Aviad Rubinstein, Amirbehshad Shahrasbi Near-linear time insertion-deletion codes and (1+ε)-approximating edit distance via indexing. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Akash Kumar 0003, C. Seshadhri, Andrew Stolman Random walks and forbidden minors II: a poly(d ε-1)-query tester for minor-closed properties of bounded degree graphs. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ewin Tang A quantum-inspired classical algorithm for recommendation systems. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kun He 0011, Qian Li, Xiaoming Sun, Jiapeng Zhang Quantum Lovász local lemma: Shearer's bound is tight. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Marvin Künnemann, Karol Wegrzycki Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dylan M. McKay, Cody D. Murray, R. Ryan Williams Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin 1+ε approximation of tree edit distance in quadratic time. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Alessio Conte, Takeaki Uno New polynomial delay bounds for maximal subgraph enumeration by proximity search. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001 Testing graphs in vertex-distribution-free models. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Clément L. Canonne, Gautam Kamath, Audra McMillan, Adam D. Smith, Jonathan Ullman The structure of optimal private tests for simple hypotheses. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yael Tauman Kalai, Omer Paneth, Lisa Yang How to delegate computations publicly. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nir Bitansky, Dakshita Khurana, Omer Paneth Weak zero-knowledge beyond the black-box barrier. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael A. Bekos, Henry Förster, Martin Gronemann, Tamara Mchedlidze, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Torsten Ueckerdt Planar graphs of bounded degree have bounded queue number. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ryan O'Donnell, Rocco A. Servedio, Li-Yang Tan Fooling polytopes. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai Breaking quadratic time for small vertex connectivity and an approximation scheme. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Omar Alrabiah, Venkatesan Guruswami An exponential lower bound on the sub-packetization of MSR codes. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Joshua Brakensiek, Venkatesan Guruswami Bridging between 0/1 and linear programming via random walks. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arun Ganesh, Qiuyi (Richard) Zhang Optimal sequence length requirements for phylogenetic tree reconstruction with indels. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick Faster k-SAT algorithms using biased-PPSZ. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Uri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz Communication complexity of estimating correlations. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Christian Coester, Elias Koutsoupias The online k-taxi problem. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dan Alistarh, James Aspnes, Faith Ellen, Rati Gelashvili, Leqi Zhu Why extension-based proofs fail. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1László Babai Canonical form for graphs in quasipolynomial time: preliminary report. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vasileios Nakos, Zhao Song Stronger l2/l2 compressed sensing; without iterating. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1János Pach, Natan Rubin, Gábor Tardos Planar point sets determine many pairwise crossing segments. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yakov Babichenko, Shahar Dobzinski, Noam Nisan The communication complexity of local search. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vatsal Sharan, Aaron Sidford, Gregory Valiant Memory-sample tradeoffs for linear regression with small error. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jian Ding, Nike Sun Capacity lower bound for the Ising perceptron. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Deeparnab Chakrabarty, Chaitanya Swamy Approximation algorithms for minimum norm and ordered optimization problems. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ilias Diakonikolas, Daniel M. Kane Degree-푑 chow parameters robustly determine degree-푑 PTFs (and algorithmic applications). Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sandip Sinha, Omri Weinstein Local decodability of the Burrows-Wheeler transform. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Luca Becchetti, Marc Bury, Vincent Cohen-Addad, Fabrizio Grandoni 0001, Chris Schwiegelshohn Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zeev Dvir, Alexander Golovnev, Omri Weinstein Static data structure lower bounds imply rigidity. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Aris Filos-Ratsikas, Paul W. Goldberg The complexity of splitting necklaces and bisecting ham sandwiches. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jingcheng Liu 0001, Kunal Talwar Private selection from private candidates. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal On a generalization of iterated and randomized rounding. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hsin-Hao Su, Hoa T. Vu Towards the locality of Vizing's theorem. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bartlomiej Dudek 0001, Pawel Gawrychowski Computing quartet distance is equivalent to counting 4-cycles. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Guy Bresler, Frederic Koehler, Ankur Moitra Learning restricted Boltzmann machines via influence maximization. Search on Bibsonomy STOC The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 3449 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
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