The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Infinity with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1942-1985 (18) 1986-1989 (16) 1990-1991 (15) 1992-1993 (23) 1994-1995 (29) 1996 (27) 1997 (30) 1998 (29) 1999 (29) 2000 (30) 2001 (38) 2002 (48) 2003 (50) 2004 (73) 2005 (119) 2006 (105) 2007 (142) 2008 (140) 2009 (113) 2010 (44) 2011 (58) 2012 (41) 2013 (55) 2014 (46) 2015 (46) 2016 (37) 2017 (42) 2018 (37) 2019 (58) 2020 (73) 2021 (46) 2022 (48) 2023 (47) 2024 (20)
Publication types (Num. hits)
article(890) book(1) incollection(9) inproceedings(848) phdthesis(10) proceedings(14)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 614 occurrences of 483 keywords

Results
Found 1772 publication records. Showing 1772 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
68Harvey L. Davies Infinity Arithmetic, Comparisons and J. Search on Bibsonomy APL The full citation details ... 1995 DBLP  DOI  BibTeX  RDF NaN, error-trapping, indeterminate, infinity arithmetic, APL, comparison, precision, arithmetic, tolerance, comparative, J, limits, infinity, IEEE 754 Standard
63Andreas Schmid 0002, Olaf Kandel, Christoph Steigner Avoiding Counting to Infinity in Distance Vector Routing. Search on Bibsonomy ICN (1) The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Routing Information Protocol, Counting to Infinity, Internet, Protocol Design
58Chefi Ketata, Mysore G. Satish, M. Rafiqul Islam The Meaningful Infinity. Search on Bibsonomy CIMCA/IAWTIC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
52Philippe Schnoebelen Preface: Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003. Search on Bibsonomy INFINITY The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
49Khaled Elmeleegy, Alan L. Cox, T. S. Eugene Ng Understanding and mitigating the effects of count to infinity in Ethernet networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF spanning tree protocols, reliability, ethernet, Ethernet
49Fei Shen, Han Wang 0001 A linear algorithm to estimate the plane of infinity. Search on Bibsonomy ICARCV The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
49Richard I. Hartley, Lourdes de Agapito, Ian D. Reid 0001, Eric Hayman Camera Calibration and the Search for Infinity. Search on Bibsonomy ICCV The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
46Mircea Lazar, Andrej Jokic On infinity norms as Lyapunov functions for piecewise affine systems. Search on Bibsonomy HSCC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF infinity norms, output feedback, stability, lyapunov methods, piecewise affine systems
46Jyotirmay Gadewadikar, Frank L. Lewis, Kamesh Subbarao, Kemao Peng, Ben M. Chen H-Infinity Static Output-feedback Control for Rotorcraft. Search on Bibsonomy J. Intell. Robotic Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF H-Infinity control, Unmanned aerial vehicles
40Alvin Cheung, Tyrone Grandison, Christopher M. Johnson, Stefan Schönauer Ïnfïnïty: a generic platform for application development and information sharing on mobile devices. Search on Bibsonomy MobiDE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF collaboration, information sharing, privacy preservation, mobile middleware
40Michael Beeson, Freek Wiedijk The Meaning of Infinity in Calculus and Computer Algebra Systems. Search on Bibsonomy AISC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
37Lukás Holík, Lorenzo Clemente (eds.) Proceedings 15th International Workshop on Verification of Infinite-State Systems, INFINITY 2013, Hanoi, Vietnam, 14th October 2013. Search on Bibsonomy INFINITY The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
37Parosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman Zenoness for Timed Pushdown Automata. Search on Bibsonomy INFINITY The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
37Oded Maler Algorithmic Verification of Continuous and Hybrid Systems. Search on Bibsonomy INFINITY The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
37Johann Schuster, Markus Siegle Lattice structures for bisimilar Probabilistic Automata. Search on Bibsonomy INFINITY The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
37Gal Katz, Doron A. Peled Synthesis of Parametric Programs using Genetic Programming and Model Checking. Search on Bibsonomy INFINITY The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
37Yu-Fang Chen 0001, Bow-Yaw Wang, Di-De Yen A Finite Exact Representation of Register Automata Configurations. Search on Bibsonomy INFINITY The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
37Mohamed Faouzi Atig, Ahmed Rezine (eds.) Proceedings 14th International Workshop on Verification of Infinite-State Systems, Infinity 2012, Paris, France, 27th August 2012. Search on Bibsonomy Infinity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
37Parosh Aziz Abdulla, Richard Mayr Petri Nets with Time and Cost Search on Bibsonomy Infinity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
37Arnaud Gotlieb, Tristan Denmat, Nadjib Lazaar Constraint-based reachability Search on Bibsonomy Infinity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
37Aurel Randolph, Hanifa Boucheneb, Abdessamad Imine, Alejandro Quintero On Consistency of Operational Transformation Approach Search on Bibsonomy Infinity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
37Lukasz Fronc Effective Marking Equivalence Checking in Systems with Dynamic Process Creation Search on Bibsonomy Infinity The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
37Fang Yu 0001, Chao Wang (eds.) Proceedings 13th International Workshop on Verification of Infinite-State Systems, INFINITY 2011, Taipei, Taiwan, 10th October 2011. Search on Bibsonomy INFINITY The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
37Christian Krause 0001, Holger Giese Model Checking Probabilistic Real-Time Properties for Service-Oriented Systems with Service Level Agreements Search on Bibsonomy INFINITY The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
37Doron A. Peled, Sven Schewe Practical Distributed Control Synthesis Search on Bibsonomy INFINITY The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
37Laurent Fribourg, Bertrand Revol, Romain Soulat Synthesis of Switching Rules for Ensuring Reachability Properties of Sampled Linear Systems Search on Bibsonomy INFINITY The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
37Alex Spelten, Wolfgang Thomas, Sarah Winter Trees over Infinite Structures and Path Logics with Synchronization Search on Bibsonomy INFINITY The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
37Alberto Ciaffaglione A coinductive semantics of the Unlimited Register Machine Search on Bibsonomy INFINITY The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
37Takashi Tomita, Shigeki Hagihara, Naoki Yonezaki A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking Search on Bibsonomy INFINITY The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
37Yu-Fang Chen 0001, Ahmed Rezine (eds.) Proceedings 12th International Workshop on Verification of Infinite-State Systems, INFINITY 2010, Singapore, Singapore, 21st September 2010. Search on Bibsonomy INFINITY The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
37Étienne André IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata Search on Bibsonomy INFINITY The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
37Nathalie Bertrand 0001, Christophe Morvan Probabilistic regular graphs Search on Bibsonomy INFINITY The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
37Frédéric Peschanski, Hanna Klaudel, Raymond R. Devillers A Decidable Characterization of a Graphical Pi-calculus with Iterators Search on Bibsonomy INFINITY The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
37Stéphane Demri On Selective Unboundedness of VASS Search on Bibsonomy INFINITY The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
37Bernard Boigelot, Julien Brusten, Jean-François Degbomont Implicit Real Vector Automata Search on Bibsonomy INFINITY The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
37Oded Maler, Kim G. Larsen, Bruce H. Krogh On Zone-Based Analysis of Duration Probabilistic Automata Search on Bibsonomy INFINITY The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
37Hanifa Boucheneb, Kamel Barkaoui On interleaving in {P,A}-Time Petri nets with strong semantics Search on Bibsonomy INFINITY The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
37Axel Legay (eds.) Proceedings International Workshop on Verification of Infinite-State Systems, INFINITY 2009, Bologna, Italy, 31th August 2009. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Peter Habermehl, Tomás Vojnar (eds.) Joint Proceedings of the 8th, 9th, and 10th International Workshops on Verification of Infinite-State Systems, INFINITY 2006 / 2007 / 2008, Bonn, Germany, August 26, 2006 / Lisbon, Portugal, September 8, 2007 / Toronto, Canada, August 23, 2008 Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  BibTeX  RDF
37Christophe Morvan On external presentations of infinite graphs Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Bahareh Badban, Stefan Leue, Jan-Georg Smaus Automated Predicate Abstraction for Real-Time Models Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Nguyen Van Tang A Tighter Bound for the Determinization of Visibly Pushdown Automata Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Florent Bouchy, Alain Finkel, Pierluigi San Pietro Dense-choice Counter Machines revisited Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Laurent Fribourg, Étienne André An Inverse Method for Policy-Iteration Based Algorithms Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Peter Habermehl, Tomás Vojnar Preface. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Ulrich Fahrenberg, Kim Guldstrand Larsen Discount-Optimal Infinite Runs in Priced Timed Automata. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Narjes Ben Rajeb, Brahim Nasraoui, Riadh Robbana, Tayssir Touili Verifying Multithreaded Recursive Programs with Integer Variables. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Mojmír Kretínský, Vojtech Rehák, Jan Strejcek On Decidability of LTL+Past Model Checking for Process Rewrite Systems. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Sibylle B. Fröschle, Slawomir Lasota 0001 Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Hanifa Boucheneb, Kamel Barkaoui Covering Steps Graphs of Time Petri Nets. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Emmanuelle Encrenaz, Alain Finkel Automatic Verification of Counter Systems With Ranking Function. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Parosh Aziz Abdulla, Pavel Krcál, Wang Yi 0001 Universality of R-automata with Value Copying. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Florent Bouchy, Alain Finkel, Arnaud Sangnier Reachability in Timed Counter Systems. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Franck Pommereau, Raymond R. Devillers, Hanna Klaudel Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Giorgio Delzanno, Roberto Montagna Deciding Reachability in Mobile Ambients with Name Restriction. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Mihaela Sighireanu, Tayssir Touili Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Régis Gascon An Automata-based Approach for CTL* With Constraints. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Tomás Brázdil, Václav Brozek, Vojtech Forejt Branching-Time Model-Checking of Probabilistic Pushdown Automata. Search on Bibsonomy INFINITY The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Jirí Srba, Scott A. Smolka (eds.) Proceedings of the 7th International Workshop on Verification of Infinite-State Systems, INFINITY 2005, San Francisco, CA, USA, August 27, 2005 Search on Bibsonomy INFINITY The full citation details ... 2006 DBLP  BibTeX  RDF
37Julian C. Bradfield, Faron Moller (eds.) Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, INFINITY 2004, London, UK, September 4, 2004 Search on Bibsonomy INFINITY The full citation details ... 2005 DBLP  BibTeX  RDF
37Jirí Srba, Scott A. Smolka Preface. Search on Bibsonomy INFINITY The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar Abstract Regular Tree Model Checking. Search on Bibsonomy INFINITY The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Viktor Schuppan, Armin Biere Liveness Checking as Safety Checking for Infinite State Spaces. Search on Bibsonomy INFINITY The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Paul C. Attie, Hana Chockler Automatic Verification of Fault-Tolerant Register Emulations. Search on Bibsonomy INFINITY The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Venkatesh Mysore, Bud Mishra Algorithmic Algebraic Model Checking III: Approximate Methods. Search on Bibsonomy INFINITY The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Antonín Kucera 0001 Methods for Quantitative Analysis of Probabilistic Pushdown Automata. Search on Bibsonomy INFINITY The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Mojmír Kretínský, Vojtech Rehák, Jan Strejcek Refining the Undecidability Border of Weak Bisimilarity. Search on Bibsonomy INFINITY The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Philippe Schnoebelen (eds.) Proceedings of INFINITY 2003, the 5th International Workshop on Verification of Infinite-State Systems, a satellite workshop of CONCUR 2003, Marseille, France, September 2, 2003 Search on Bibsonomy INFINITY The full citation details ... 2004 DBLP  BibTeX  RDF
37Olga Grinchtein, Bengt Jonsson 0001, Martin Leucker Inference of Timed Transition Systems. Search on Bibsonomy INFINITY The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Martin Kot, Zdenek Sawa Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time. Search on Bibsonomy INFINITY The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Ahmed Bouajjani, Axel Legay, Pierre Wolper Handling Liveness Properties in (omega-)Regular Model Checking. Search on Bibsonomy INFINITY The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Jesse D. Bingham A New Approach to Upward-Closed Set Backward Reachability Analysis. Search on Bibsonomy INFINITY The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Peter Habermehl, Tomás Vojnar Regular Model Checking Using Inference of Regular Languages. Search on Bibsonomy INFINITY The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata Closed, Open, and Robust Timed Networks. Search on Bibsonomy INFINITY The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Ahmed Bouajjani, Javier Esparza, Tayssir Touili Reachability Analysis of Synchronized PA Systems. Search on Bibsonomy INFINITY The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Ranko Lazic 0001 Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification. Search on Bibsonomy INFINITY The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Ranko Lazic 0001, Thomas Christopher Newcomb, Bill Roscoe Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting. Search on Bibsonomy INFINITY The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Julian C. Bradfield, Faron Moller Preface. Search on Bibsonomy INFINITY The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Antonín Kucera 0001, Richard Mayr (eds.) 4th International Workshop on Verification of Infinite-State Systems (CONCUR 2002 Satellite Workshop), Infinity 2002, Brno, Czech Republic, August 24, 2002 Search on Bibsonomy INFINITY The full citation details ... 2003 DBLP  BibTeX  RDF
37Giorgio Delzanno A Symbolic Procedure for Control Reachability in the Asynchronous Pi-calculus: Extended Abstract. Search on Bibsonomy INFINITY The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
37Jean-François Raskin, Laurent Van Begin Petri Nets with Non-blocking Arcs are Difficult to Analyze. Search on Bibsonomy INFINITY The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
37Jérôme Leroux The Affine Hull of a Binary Automaton is Computable in Polynomial Time. Search on Bibsonomy INFINITY The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
37Jirí Srba Completeness Results for Undecidable Bisimilarity Problems. Search on Bibsonomy INFINITY The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
37Olga Grinchtein, Martin Leucker Network Invariants for Real-Time Systems. Search on Bibsonomy INFINITY The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
37Mojmír Kretínský, Vojtech Rehák, Jan Strejcek On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit. Search on Bibsonomy INFINITY The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
37Anders Møller Verifying Programs that Manipulate Pointers: (Invited Talk). Search on Bibsonomy INFINITY The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
37Antonín Kucera 0001, Richard Mayr Preface. Search on Bibsonomy INFINITY The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
37Thierry Cachat Uniform Solution of Parity Games on Prefix-Recognizable Graphs. Search on Bibsonomy INFINITY The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
37Jitka Stríbrná, Ivana Cerná Modifications of Expansion Trees for Weak Bisimulation in BPA. Search on Bibsonomy INFINITY The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
37Chloe Rispal The synchronized graphs trace the context-sensitive languages. Search on Bibsonomy INFINITY The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
37Thomas Colcombet Rewriting in the partial algebra of typed terms modulo AC. Search on Bibsonomy INFINITY The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
37Hans Hüttel Deciding Framed Bisimilarity. Search on Bibsonomy INFINITY The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
37Alain Finkel, Jean-François Raskin, Mathias Samuelides, Laurent Van Begin Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. Search on Bibsonomy INFINITY The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
37Bernhard Steffen, Didier Caucal (eds.) First International Workshop on Verification of Infinite State Systems, Infinity 1996, Università di Pisa, Pisa, Italy, August 30-31, 1996 Search on Bibsonomy INFINITY The full citation details ... 1997 DBLP  BibTeX  RDF
37Faron Moller (eds.) Second International Workshop on Verification of Infinite State Systems, Infinity 1997, Bologna, Italy, July 11-12, 1997 Search on Bibsonomy INFINITY The full citation details ... 1997 DBLP  BibTeX  RDF
37Alain Finkel, Bernard Willems, Pierre Wolper A direct symbolic approach to model checking pushdown systems. Search on Bibsonomy INFINITY The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
37Géraud Sénizergues L(A) = L(B)? Search on Bibsonomy INFINITY The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
37Felice Balarin Verifying invariants by approximate image computation. Search on Bibsonomy INFINITY The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
37Olaf Burkart Model checking rationally restricted right closures of recognizable graphs. Search on Bibsonomy INFINITY The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1772 (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 L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license