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)
Publication types (Num. hits)
inproceedings(3285) proceedings(50)
Venues (Conferences, Journals, ...)
STOC(3335)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1771 occurrences of 757 keywords

Results
Found 3335 publication records. Showing 3335 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Max Simchowitz, Ahmed El Alaoui, Benjamin Recht Tight query complexity lower bounds for PCA via finite sample deformed wigner law. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mark de Berg, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yuval Emek, Shay Kutten, Ron Lavi, Yangguang Shi Approximating generalized network design under (dis)economies of scale with applications to energy efficiency. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Karthik C. S., Bundit Laekhanukit, Pasin Manurangsi On the parameterized complexity of approximating dominating set. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Josh Alman, Joshua R. Wang, Huacheng Yu Cell-probe lower bounds from online communication complexity. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sébastien Bubeck, Michael B. Cohen, Yin Tat Lee, James R. Lee, Aleksander Madry k-server via multiscale entropic regularization. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mark Bun, Cynthia Dwork, Guy N. Rothblum, Thomas Steinke Composable and versatile privacy via truncated CDP. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aaron Schild An almost-linear time algorithm for uniform random spanning tree generation. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sumegha Garg, Ran Raz, Avishay Tal Extractor-based time-space lower bounds for learning. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Julia Chuzhoy, David H. K. Kim, Rachit Nimavat Almost polynomial hardness of node-disjoint paths in grids. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pranjal Dutta, Nitin Saxena 0001, Amit Sinhababu Discovering the roots: uniform closure results for algebraic classes under factoring. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Toniann Pitassi, Robert Robere Lifting nullstellensatz to monotone span programs over any field. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Manindra Agrawal, Sumanta Ghosh, Nitin Saxena 0001 Bootstrapping variables in algebraic circuits. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Diptarka Chakraborty, Lior Kamma, Kasper Green Larsen Tight cell probe bounds for succinct Boolean matrix-vector multiplication. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ankit Garg, Yin Tat Lee, Zhao Song, Nikhil Srivastava A matrix expander Chernoff bound. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dominik Kempa, Nicola Prezza At the roots of dictionary compression: string attractors. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart Learning geometric concepts with nasty noise. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nir Bitansky, Yael Tauman Kalai, Omer Paneth Multi-collision resistance: a paradigm for keyless hash functions. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee, Akshay Ramachandran The Paulsen problem, continuous operator scaling, and smoothed analysis. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aris Filos-Ratsikas, Paul W. Goldberg Consensus halving is PPA-complete. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Samuel B. Hopkins, Jerry Li 0001 Mixture models, robustness, and sum of squares proofs. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Kasper Green Larsen, Omri Weinstein, Huacheng Yu Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic Inapproximability of the independent set polynomial in the complex plane. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fabrizio Grandoni 0001, Tobias Mömke, Andreas Wiese, Hang Zhou 0001 A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Saikrishna Badrinarayanan, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs Succinct delegation for low-space non-deterministic computation. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Artur Czumaj, Jakub Lacki, Aleksander Madry, Slobodan Mitrovic, Krzysztof Onak, Piotr Sankowski Round compression for parallel matching algorithms. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Krzysztof Onak, Xiaorui Sun The query complexity of graph isomorphism: bypassing distribution testing lower bounds. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon Fully dynamic maximal independent set with sublinear update time. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Constantinos Daskalakis, Christos Tzamos, Manolis Zampetakis A converse to Banach's fixed point theorem and its CLS-completeness. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pravesh K. Kothari, Jacob Steinhardt, David Steurer Robust moment estimation and improved clustering via sum of squares. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tengyu Ma Generalization and equilibrium in generative adversarial nets (GANs) (invited talk). Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Matthias Christandl, Péter Vrana, Jeroen Zuiddam Universal points in the asymptotic spectrum of tensors. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mark Braverman, Gillat Kol Interactive compression to external information. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak Sparse Kneser graphs are Hamiltonian. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Zeyuan Allen-Zhu, Ankit Garg, Yuanzhi Li, Rafael Mendes de Oliveira, Avi Wigderson Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Omar Fawzi, Antoine Grospellier, Anthony Leverrier Efficient decoding of random errors for quantum expander codes. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup Fast fencing. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cody Murray, R. Ryan Williams Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cole Franks Operator scaling with specified marginals. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Roei Tell Quantified derandomization of linear threshold circuits. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rasmus Kyng, Richard Peng, Robert Schwieterman, Peng Zhang Incomplete nested dissection. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sébastien Bubeck, Michael B. Cohen, Yin Tat Lee, Yuanzhi Li An homotopy method for lp regression provably beyond self-concordance and in input-sparsity time. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bernhard Haeupler, Amirbehshad Shahrasbi Synchronization strings: explicit constructions, local decoding, and applications. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Debbie Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu Capacity approaching coding for low noise interactive quantum communication. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Darrell Hoy, Samuel Taggart, Zihe Wang A tighter welfare guarantee for first-price auctions. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Aviad Rubinstein Hardness of approximate nearest neighbor search. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vipul Goyal, Ashutosh Kumar 0002 Non-malleable secret sharing. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow The art gallery problem is ∃ ℝ-complete. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof More consequences of falsifying SETH and the orthogonal vectors conjecture. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pravesh K. Kothari, Ruta Mehta Sum-of-squares meets nash: lower bounds for finding any equilibrium. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov Clique is hard on average for regular resolution. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mohsen Ghaffari, Jason Li Improved distributed algorithms for exact shortest paths. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn Nonlinear dimension reduction via outer Bi-Lipschitz extensions. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ilias Diakonikolas, David Kempe 0001, Monika Henzinger (eds.) Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018 Search on Bibsonomy STOC The full citation details ... 2018 DBLP  BibTeX  RDF
1Zhiyi Huang 0002, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, Xue Zhu How to match when all vertices arrive online. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay Simulation beats richness: new data-structure lower bounds. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart Testing conditional independence of discrete distributions. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ilias Diakonikolas, Daniel M. Kane, Alistair Stewart List-decodable robust mean estimation and learning mixtures of spherical gaussians. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Holger Dell, John Lapinskas Fine-grained reductions from approximate counting to decision. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nikhil Bansal, Daniel Dadush, Shashwat Garg, Shachar Lovett The gram-schmidt walk: a cure for the Banaszczyk blues. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jeremy T. Fineman Nearly work-efficient parallel algorithm for digraph reachability. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jeff Erickson 0001, Kyle Fox, Luvsandondov Lkhamsuren Holiest minimum-cost paths and flows in surface graphs. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman Metric embedding via shortest path decompositions. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mark Bun, Robin Kothari, Justin Thaler The polynomial method strikes back: tight quantum query bounds via dual polynomials. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mark Braverman, Gil Cohen, Sumegha Garg Hitting sets with near-optimal error for read-once branching programs. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alexander A. Sherstov Algorithmic polynomials. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Udit Agarwal, Vijaya Ramachandran Fine-grained complexity for sparse graphs. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel Dadush, Sophie Huiberts A friendly smoothed analysis of the simplex method. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Gil Cohen, Bernhard Haeupler, Leonard J. Schulman Explicit binary tree codes with polylogarithmic size alphabet. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yannai A. Gonczarowski Bounding the menu-size of approximately optimal auctions via optimal-transport duality. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane, Shachar Lovett, Shay Moran Near-optimal linear decision trees for k-SUM and related problems. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Talya Eden, Dana Ron, C. Seshadhri On approximating the number of k-cliques in sublinear time. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eric Balkanski, Yaron Singer The adaptive complexity of maximizing a submodular function. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Divesh Aggarwal, Noah Stephens-Davidowitz (Gap/S)ETH hardness of SVP. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, Muli Safra On non-optimally expanding sets in Grassmann graphs. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yin Tat Lee, Santosh S. Vempala Stochastic localization + Stieltjes barrier = tight bound for log-Sobolev. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fabrizio Grandoni 0001, Christos Kalaitzis, Rico Zenklusen Improved approximation for tree augmentation: saving by rewiring. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Irene Lo Dynamic matching in school choice: efficient seat reassignment after late cancellations (invited talk). Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jesús A. De Loera, Jamie Haddock, Luis Rademacher The minimum euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponential. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hamed Omidvar, Massimo Franceschetti Shape of diffusion and size of monochromatic region of a two-dimensional spin system. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mahdi Cheraghchi Capacity upper bounds for deletion-type channels. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rishab Goyal, Venkata Koppula, Brent Waters Collusion resistant traitor tracing from learning with errors. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bartlomiej Dudek, Adrian Kosowski Universal protocols for information dissemination using emergent signals. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tali Kaufman, Izhar Oppenheim Construction of new local spectral high dimensional expanders. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tianren Liu, Vinod Vaikuntanathan Breaking the circuit-size barrier in secret sharing. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lior Gishboliner, Asaf Shapira A generalized Turán problem and its applications. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ravishankar Krishnaswamy, Shi Li, Sai Sandeep Constant approximation for k-median and k-means with outliers via iterative rounding. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yin Tat Lee, Santosh S. Vempala Convergence rate of riemannian Hamiltonian Monte Carlo and faster polytope volume computation. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Arturs Backurs, Liam Roditty, Gilad Segal, Virginia Vassilevska Williams, Nicole Wein Towards tight approximation bounds for graph diameter and eccentricities. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ankit Garg, Mika Göös, Pritish Kamath, Dmitry Sokolov 0001 Monotone circuit lower bounds from resolution. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Klim Efremenko, Gillat Kol, Raghuvansh Saxena Interactive coding over the noisy broadcast channel. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ola Svensson, Jakub Tarnawski, László A. Végh A constant-factor approximation algorithm for the asymmetric traveling salesman problem. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Zhengyang Liu, Xi Chen, Rocco A. Servedio, Ying Sheng, Jinyu Xie Distribution-free junta testing. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Markus Bläser, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov Generalized matrix completion and algebraic natural proofs. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme Stochastic bandits robust to adversarial corruptions. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan General strong polarization. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto Deterministic distributed edge-coloring with fewer colors. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Cornelius Brand, Holger Dell, Thore Husfeldt Extensor-coding. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Scott Aaronson Shadow tomography of quantum states. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Anna R. Karlin, Shayan Oveis Gharan, Robbie Weber A simply exponential upper bound on the maximum number of stable matchings. Search on Bibsonomy STOC The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 3335 (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