The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Dimitris Achlioptas Demetrios Achlioptas ( http://dblp.L3S.de/Authors/Dimitris_Achlioptas )

Publication years (Num. hits)
1996-2001 (24) 2002-2004 (19) 2005-2009 (16) 2010-2015 (20) 2016-2018 (16) 2019 (4)
Publication types (Num. hits)
article(47) incollection(1) inproceedings(50) proceedings(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 31 occurrences of 23 keywords

Results
Found 100 publication records. Showing 99 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Shengchao Liu, Dimitris S. Papailiopoulos, Dimitris Achlioptas Bad Global Minima Exist and SGD Can Reach Them. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Panos Theodoropoulos Model counting with error-correcting codes. Search on Bibsonomy Constraints The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Fotis Iliopoulos, Vladimir Kolmogorov A Local Lemma for Focused Stochastic Algorithms. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, László A. Végh (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2019 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos Local Computation Algorithms for the Lovász Local Lemma. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Fotis Iliopoulos, Vladimir Kolmogorov A Local Lemma for Focused Stochastic Algorithms. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair A New Perspective on Stochastic Local Search and the Lovasz Local Lemma. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Paris Siminelakis Symmetric graph properties have independent edges. Search on Bibsonomy Inf. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Zayd Hammoudeh, Panos Theodoropoulos Fast and Flexible Probabilistic Model Counting. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Zayd S. Hammoudeh, Panos Theodoropoulos Fast Sampling of Perfectly Uniform Satisfying Assignments. Search on Bibsonomy SAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Panos Theodoropoulos Probabilistic Model Counting with Short XORs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Seyed Hamed Hassani, Wei Liu, Rüdiger L. Urbanke Time-Invariant LDPC Convolutional Codes. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Fotis Iliopoulos, Nikos Vlassis Stochastic Control via Entropy Compression. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, S. Hamed Hassani, Wei Liu, Rüdiger L. Urbanke Time-invariant LDPC convolutional codes. Search on Bibsonomy ISIT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Panos Theodoropoulos Probabilistic Model Counting with Short XORs. Search on Bibsonomy SAT The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Alex Gittens, Dimitris Achlioptas, Michael W. Mahoney Skip-Gram - Zipf + Uniform = Vector Additivity. Search on Bibsonomy ACL (1) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Fotis Iliopoulos Random Walks That Find Perfect Objects and the Lovász Local Lemma. Search on Bibsonomy J. ACM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Fotis Iliopoulos, Nikos Vlassis Stochastic Control via Entropy Compression. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Seyed Hamed Hassani, Nicolas Macris, Rüdiger L. Urbanke Bounds for Random Constraint Satisfaction Problems via Spatial Coupling. Search on Bibsonomy SODA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Fotis Iliopoulos Focused Stochastic Local Search and the Lovász Local Lemma. Search on Bibsonomy SODA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Fotis Iliopoulos Focused Stochastic Local Search and the Lovász Local Lemma. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Paris Siminelakis Navigability is a Robust Property. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Paris Siminelakis Product Measure Approximation of Symmetric Graph Properties. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Michael Molloy The solution space geometry of random linear equations. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Pei Jiang 0001 Stochastic Integration via Error-Correcting Codes. Search on Bibsonomy UAI The full citation details ... 2015 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Paris Siminelakis Symmetric Graph Properties Have Independent Edges. Search on Bibsonomy ICALP (2) The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Paris Siminelakis Navigability is a Robust Property. Search on Bibsonomy WAW The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Fotis Iliopoulos The Lovász Local Lemma as a Random Walk. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Fotis Iliopoulos Random Walks That Find Perfect Objects and the Lovasz Local Lemma. Search on Bibsonomy FOCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Dimitris Skourtis, Dimitris Achlioptas, Noah Watkins, Carlos Maltzahn, Scott A. Brandt Flash on Rails: Consistent Flash Performance through Redundancy. Search on Bibsonomy USENIX Annual Technical Conference The full citation details ... 2014 DBLP  BibTeX  RDF
1Dimitris Skourtis, Dimitris Achlioptas, Noah Watkins, Carlos Maltzahn, Scott A. Brandt Erasure Coding & Read/Write Separation in Flash Storage. Search on Bibsonomy INFLOW The full citation details ... 2014 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Zohar Shay Karnin, Edo Liberty Near-Optimal Entrywise Sampling for Data Matrices. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Dimitris Skourtis, Dimitris Achlioptas, Carlos Maltzahn, Scott A. Brandt High performance & low latency in solid-state drives through redundancy. Search on Bibsonomy INFLOW@SOSP The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Zohar Shay Karnin, Edo Liberty Near-Optimal Entrywise Sampling for Data Matrices. Search on Bibsonomy NIPS The full citation details ... 2013 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Ricardo Menchaca-Mendez Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method. Search on Bibsonomy ICALP (1) The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Ricardo Menchaca-Mendez Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas. Search on Bibsonomy SAT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Themis Gouleakis Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion . Search on Bibsonomy FSTTCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Michael Molloy The solution space geometry of random linear equations Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Amin Coja-Oghlan, Federico Ricci-Tersenghi On the solution-space geometry of random constraint satisfaction problems. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas Algorithmic Barriers from Phase Transitions in Graphs. Search on Bibsonomy WG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Aaron Clauset, David Kempe 0001, Cristopher Moore On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF sampling bias, Internet topology, traceroute
1Dimitris Achlioptas, Federico Ricci-Tersenghi Random Formulas Have Frozen Variables. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas Random Satisfiability. Search on Bibsonomy Handbook of Satisfiability The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Amin Coja-Oghlan Algorithmic Barriers from Phase Transitions. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Frank McSherry Fast computation of low-rank matrix approximations. Search on Bibsonomy J. ACM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF sampling, Singular value decomposition, low rank approximation
1Dimitris Achlioptas, Assaf Naor, Yuval Peres On the maximum satisfiability of random formulas. Search on Bibsonomy J. ACM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Maximum satisfiability
1Dimitris Achlioptas, Vladlen Koltun Special Section on Foundations of Computer Science. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2007 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Federico Ricci-Tersenghi On the Solution-Space Geometry of Random Constraint Satisfaction Problems Search on Bibsonomy CoRR The full citation details ... 2006 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Cristopher Moore Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Federico Ricci-Tersenghi On the solution-space geometry of random constraint satisfaction problems. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF random formulas, survey propagation, satisfiability
1Dimitris Achlioptas, Stefano Leonardi Special Issue on Algorithms and Models for the Web-Graph. Search on Bibsonomy Internet Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Haixia Jia, Cristopher Moore Hiding Satisfying Assignments: Two are Better than One. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Aaron Clauset, David Kempe 0001, Cristopher Moore On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in Regular Graphs Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Haixia Jia, Cristopher Moore Hiding Satisfying Assignments: Two are Better than One Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Frank McSherry On Spectral Learning of Mixtures of Distributions. Search on Bibsonomy COLT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF learning mixtures of distributions, log-concave and concentrated distributions, singular value decomposition, spectral methods, gaussians mixtures
1Dimitris Achlioptas, Aaron Clauset, David Kempe 0001, Cristopher Moore On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF internet mapping, random graphs, power laws
1Yi-Min Wang, Lili Qiu, Chad Verbowski, Dimitris Achlioptas, Gautam Das 0001, Per-Åke Larson Summary-based routing for content-based event distribution networks. Search on Bibsonomy Computer Communication Review The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy A sharp threshold in proof complexity yields lower bounds for satisfiability search. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas Random Matrices in Data Analysis. Search on Bibsonomy PKDD The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Paul Beame, Michael Molloy Exponential bounds for DPLL below the satisfiability threshold. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Haixia Jia, Cristopher Moore Hiding Satisfying Assignments: Two Are Better than One. Search on Bibsonomy AAAI The full citation details ... 2004 DBLP  BibTeX  RDF
1Dimitris Achlioptas Random Matrices in Data Analysis. Search on Bibsonomy ECML The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Assaf Naor The two possible values of the chromatic number of a random graph. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF graph coloring, random graphs, chromatic number
1Dimitris Achlioptas, Cristopher Moore The Chromatic Number of Random Regular Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Michael S. O. Molloy, Cristopher Moore, Frank Van Bussel Sampling Grid Colorings with Fewer Colors. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Cristopher Moore Almost all graphs with average degree 4 are 3-colorable. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas Database-friendly random projections: Johnson-Lindenstrauss with binary coins. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Cristopher Moore Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Yuval Peres The Threshold for Random k-SAT is 2kln2 - O(k) Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Assaf Naor, Yuval Peres On the Maximum Satisfiability of Random Formulas. Search on Bibsonomy FOCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Yuval Peres The threshold for random k-SAT is 2k (ln 2 - O(k)). Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF second moment method, satisfiability, phase transition
1Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali Two-coloring random hypergraphs. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Cristopher Moore The Asymptotic Order of the Random k -SAT Threshold. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Cristopher Moore On the 2-Colorability of Random Hypergraphs. Search on Bibsonomy RANDOM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Cristopher Moore Almost all graphs with average degree 4 are 3-colorable. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF threshold phenomena, graph coloring, random graphs
1Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel Balance and Filtering in Structured Satisfiable Problems (Preliminary Report). Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas Lower bounds for random 3-SAT via differential equations. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc Rigorous results for random (2+p)-SAT. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Michael S. O. Molloy, Lefteris M. Kirousis, Yannis C. Stamatiou, Evangelos Kranakis, Danny Krizanc Random Constraint Satisfaction: A More Accurate Picture. Search on Bibsonomy Constraints The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Arthur D. Chtcherba, Gabriel Istrate, Cristopher Moore The phase transition in 1-in-k SAT and NAE 3-SAT. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Amos Fiat, Anna R. Karlin, Frank McSherry Web Search via Hub Synthesis. Search on Bibsonomy FOCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas Database-friendly random projections. (PDF / PS) Search on Bibsonomy PODS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Frank McSherry, Bernhard Schölkopf Sampling Techniques for Kernel Methods. (PDF / PS) Search on Bibsonomy NIPS The full citation details ... 2001 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Frank McSherry Fast computation of low rank matrix. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy A sharp threshold in proof complexity. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel Balance and Filtering in Structured Satisfiable Problems. Search on Bibsonomy IJCAI The full citation details ... 2001 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Marek Chrobak, John Noga Competitive analysis of randomized paging algorithms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Gregory B. Sorkin Optimal myopic algorithms for random 3-SAT. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF optimal myopic algorithms, random 3-SAT formula, 3-clauses, unit-clause propagation extensions, expressible algorithms, max-density multiple-choice knapsack problem, optimal knapsack solution structure, lower bounds, optimisation, computability, satisfiability, differential equations, differential equations, optimization problem, randomised algorithms
1Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali Two-coloring Random Hypergraphs. Search on Bibsonomy ICALP Satellite Workshops The full citation details ... 2000 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Carla P. Gomes, Henry A. Kautz, Bart Selman Generating Satisfiable Problem Instances. Search on Bibsonomy AAAI/IAAI The full citation details ... 2000 DBLP  BibTeX  RDF
1Dimitris Achlioptas Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract). Search on Bibsonomy STOC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Michael Molloy Almost all graphs with 2.522 n edges are not 3-colorable. Search on Bibsonomy Electr. J. Comb. The full citation details ... 1999 DBLP  BibTeX  RDF
1Dimitris Achlioptas, Ehud Friedgut A Sharp Threshold for k-Colorability. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Jeff Edmonds, Chung Keung Poon, Dimitris Achlioptas Tight Lower Bounds for st-Connectivity on the NNJAG Model. Search on Bibsonomy SIAM J. Comput. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Jason I. Brown, Derek G. Corneil, Michael Molloy The existence of uniquely -G colourable graphs. Search on Bibsonomy Discrete Mathematics The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Demetrios Achlioptas The complexity of G-free colourability. Search on Bibsonomy Discrete Mathematics The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Michael S. O. Molloy The Analysis of a List-Coloring Algorithm on a Random Graph. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF list-coloring algorithm, k-coloring algorithm, tight asymptotic analysis, performance, Markov chains, random graph, differential equations, graph colouring
1Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou Random Constraint Satisfaction: A More Accurate Picture. Search on Bibsonomy CP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Dimitris Achlioptas, Marek Chrobak, John Noga Competive Analysis of Randomized Paging Algorithms. Search on Bibsonomy ESA The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #99 of 99 (100 per page; Change: )
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