The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

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

Publication years (Num. hits)
1990 (37) 1991 (38) 1992 (40) 1993 (38) 1994 (38) 1995 (41) 1996 (45) 1997 (29) 1998 (42) 1999 (39) 2000 (43) 2001 (39) 2002 (40) 2003 (34) 2004 (34) 2005 (43) 2006 (35) 2007 (34) 2008 (40) 2009 (42) 2010 (41) 2011 (37) 2012 (40) 2013 (39) 2014 (40) 2015 (40) 2016 (39) 2017 (42) 2018 (44) 2019 (43) 2020 (52) 2021 (38) 2022 (39) 2023 (41)
Publication types (Num. hits)
inproceedings(1312) proceedings(34)
Venues (Conferences, Journals, ...)
CONCUR(1346)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 101 occurrences of 66 keywords

Results
Found 1346 publication records. Showing 1346 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Joël Ouaknine, Hristina Palikareva, A. W. Roscoe 0001, James Worrell 0001 Static Livelock Analysis in CSP. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Joost-Pieter Katoen, Barbara König 0001 (eds.) CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota 0001 Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Wil M. P. van der Aalst, Arya Adriansyah, Boudewijn F. van Dongen Causal Nets: A Modeling Language Tailored towards Process Discovery. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Paritosh K. Pandya, Simoni S. Shah On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ruggero Lanotte, Massimo Merro Semantic Analysis of Gossip Protocols for Wireless Sensor Networks. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig An Automaton over Data Words That Captures EMSO Logic. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jasmin Fisher, Thomas A. Henzinger, Dejan Nickovic, Nir Piterman, Anmol V. Singh, Moshe Y. Vardi Dynamic Reactive Modules. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1C. A. R. Hoare, Akbar Hussain, Bernhard Möller, Peter W. O'Hearn, Rasmus Lerchedahl Petersen, Georg Struth On Locality and the Exchange Law for Concurrent Processes. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Jan Krcál, Jan Kretínský, Vojtech Rehák Fixed-Delay Events in Generalized Semi-Markov Processes Revisited. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vineet Kahlon Reasoning about Threads with Bounded Lock Chains. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane Timed Automata Can Always Be Made Implementable. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Farn Wang, Chung-Hao Huang, Fang Yu 0001 A Temporal Logic for the Interaction of Strategies. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ivan Lanese, Claudio Antares Mezzina, Alan Schmitt, Jean-Bernard Stefani Controlling Reversibility in Higher-Order Pi. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hans Hüttel Typed ψ-calculi. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell 0001 Tractable Reasoning in a Fragment of Separation Logic. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1M. Praveen, Kamal Lodaya Parameterized Complexity Results for 1-safe Petri Nets. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Parosh Aziz Abdulla, Yu-Fang Chen 0001, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar Advanced Ramsey-Based Büchi Automata Inclusion Testing. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Benedikt, Rastislav Lenhardt, James Worrell 0001 Two Variable vs. Linear Temporal Logic in Model Checking and Games. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Ummels, Dominik Wojtczak The Complexity of Nash Equilibria in Limit-Average Games. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Chaodong He The Decidability of the Reachability Problem for CCS! Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jonathan Hayman Granularity and Concurrent Separation Logic. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Romain Demangeon, Kohei Honda 0001 Full Abstraction in a Subtyped pi-Calculus with Linear Types. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Frédéric Herbreteau, B. Srivathsan Coarse Abstractions Make Zeno Behaviours Difficult to Detect. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christel Baier, Joachim Klein 0001, Sascha Klüppelholz A Compositional Framework for Controller Synthesis. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Rob J. van Glabbeek, Ursula Goltz, Jens-Wolfhard Schicke On Causal Semantics of Petri Nets. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Eli Gafni, Rachid Guerraoui Generalized Universality. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Stefan Göller, Anthony Widjaja Lin Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Fu Song, Tayssir Touili Efficient CTL Model-Checking for Pushdown Systems. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Salvatore La Torre, Margherita Napoli Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Roberto Bruni, Hernán C. Melgratti, Ugo Montanari A Connector Algebra for P/T Nets Interactions. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1César Rodríguez, Stefan Schwoon, Paolo Baldan Efficient Contextual Unfolding. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lei Song 0001, Lijun Zhang 0001, Jens Chr. Godskesen Bisimulations Meet PCTL Equivalences for Probabilistic Automata. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jérôme Leroux Vector Addition System Reversible Reachability Problem. Search on Bibsonomy CONCUR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marco Giunti, Vasco Thudichum Vasconcelos A Linear Account of Session Types in the Pi Calculus. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Krishnendu Chatterjee, Florian Horn 0001, Christof Löding Obliging Games. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Fides Aarts, Frits W. Vaandrager Learning I/O Automata. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ming Fu, Yong Li, Xinyu Feng 0001, Zhong Shao, Yu Zhang 0086 Reasoning about Optimistic Concurrency Using a Program Logic for History. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera 0001, Vojtech Rehák Stochastic Real-Time Games with Qualitative Timed Automata Objectives. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Pawel Sobocinski 0001 Representations of Petri Net Interactions. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Mário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi Information Flow in Interactive Systems. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tim A. C. Willemse Consistent Correlations for Parameterised Boolean Equation Systems with Applications in Correctness Proofs for Manipulations. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Thibaut Balabonski, Emmanuel Haucourt A Geometric Approach to the Problem of Unique Decomposition of Processes. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Pietro Di Gianantonio, Svetlana Jaksic, Marina Lenisa Efficient Bisimilarities from Second-Order Reaction Semantics for pi-Calculus. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Lorenzo Clemente, Richard Mayr Multipebble Simulations for Alternating Automata - (Extended Abstract). Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Lutz Schröder, Yde Venema Flat Coalgebraic Fixed Point Logics. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Christian Eisentraut, Holger Hermanns, Lijun Zhang 0001 Concurrency and Composition in a Stochastic World. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Jochen Hoenicke, Roland Meyer 0001, Ernst-Rüdiger Olderog Kleene, Rabin, and Scott Are Available. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sara Capecchi, Ilaria Castellani, Mariangiola Dezani-Ciancaglini, Tamara Rezk Session Types for Access and Information Flow Control. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ramaswamy Ramanujam, Sunil Easaw Simon A Communication Based Model for Games of Imperfect Information. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Parosh Aziz Abdulla, Yu-Fang Chen 0001, Giorgio Delzanno, Frédéric Haziza, Chih-Duo Hong, Ahmed Rezine Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ivan Lanese, Claudio Antares Mezzina, Jean-Bernard Stefani Reversing Higher-Order Pi. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Stanislav Böhm, Stefan Göller, Petr Jancar Bisimilarity of One-Counter Processes Is PSPACE-Complete. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Krishnendu Chatterjee, Laurent Doyen 0001, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou Mean-Payoff Automaton Expressions. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Mohamed Faouzi Atig From Multi to Single Stack Automata. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Paolo Baldan, Silvia Crafa A Logic for True Concurrency. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Dan R. Ghica, Mohamed Nabih Menaa On the Compositionality of Round Abstraction. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Patricia Bouyer, Romain Brenguier, Nicolas Markey Nash Equilibria for Reachability Objectives in Multi-player Timed Games. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro Parameterized Verification of Ad Hoc Networks. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Luís Caires, Frank Pfenning Session Types as Intuitionistic Linear Propositions. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Laura Bocchi, Kohei Honda 0001, Emilio Tuosto, Nobuko Yoshida A Theory of Design-by-Contract for Distributed Multiparty Interactions. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Roberto Segala, Andrea Turrini Conditional Automata: A Tool for Safe Removal of Negligible Events. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Pierre-Malo Deniélou, Nobuko Yoshida Buffered Communication Analysis in Distributed Multiparty Sessions. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ichiro Hasuo Generic Forward and Backward Simulations II: Probabilistic Simulation. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Yuxi Fu Theory by Process. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Edsko de Vries, Vasileios Koutavas, Matthew Hennessy Communicating Transactions - (Extended Abstract). Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Antoine Durand-Gasselin, Peter Habermehl On the Use of Non-deterministic Automata for Presburger Arithmetic. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Anca Muscholl Taming Distributed Asynchronous Systems. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Maurice Herlihy Applications of Shellable Complexes to Distributed Computing - (Invited Talk). Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Pavol Cerný, Thomas A. Henzinger, Arjun Radhakrishna Simulation Distances. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi Termination in Impure Concurrent Languages. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Frank S. de Boer, Mohammad Mahdi Jaghoori, Einar Broch Johnsen Dating Concurrent Objects: Real-Time Modeling and Schedulability Analysis. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Cristian Prisacariu Modal Logic over Higher Dimensional Automata. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Paul Gastin, François Laroussinie (eds.) CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vladimiro Sassone, Sardaouna Hamadou, Mu Yang Trust in Anonymity Networks. Search on Bibsonomy CONCUR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Matthew Hague, C.-H. Luke Ong Winning Regions of Pushdown Parity Games: A Saturation Method. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani Howe's Method for Calculi with Passivation. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Julian Gutierrez 0001, Julian C. Bradfield Model-Checking Games for Fixpoint Logics with Partial Order Models. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Model-checking games, Hintikka game semantics, Partial order models of concurrency, Process algebras, Modal and temporal logics
1Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexandra Silva 0001 Deriving Syntax and Axioms for Quantitative Regular Behaviours. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jérémy Planul, Ricardo Corin, Cédric Fournet Secure Enforcement for Global Process Specifications. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell 0001 Reachability in Succinct and Parametric One-Counter Automata. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Paolo Baldan, Filippo Bonchi, Fabio Gadducci Encoding Asynchronous Interactions Using Open Petri Nets. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Asynchronous calculi, open Petri nets, decidability, bisimilarity
1Roland Meyer 0001, Roberto Gorrieri On the Relationship between π-Calculus and Finite Place/Transition Petri Nets. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Matthias Schmalz, Daniele Varacca, Hagen Völzer Counterexamples in Probabilistic LTL Model Checking for Markov Chains. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michele Boreale Weighted Bisimulation in Linear Algebraic Form. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Wouter Kuijper, Jaco van de Pol Compositional Control Synthesis for Partially Observable Systems. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Joël Ouaknine, Alexander Rabinovich, James Worrell 0001 Time-Bounded Verification. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Nicolas Baudru Distributed Asynchronous Automata. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Giuseppe Castagna, Luca Padovani Contracts for Mobile Processes. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Steffen van Bakel, Maria Grazia Vigliotti A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sergio Giro, Pedro R. D'Argenio, Luis María Ferrer Fioriti Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Mario Bravetti, Gianluigi Zavattaro (eds.) CONCUR 2009 - Concurrency Theory, 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Josée Desharnais, François Laviolette, Amélie Turgeon A Demonic Approach to Information in Probabilistic Systems. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Calvin C. Newport, Nancy A. Lynch Modeling Radio Networks. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ismael Rodríguez A General Testability Theory. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Patricia Bouyer, Marie Duflot, Nicolas Markey, Gabriel Renault Measuring Permissivity in Finite Games. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Krishnendu Chatterjee, Laurent Doyen 0001, Thomas A. Henzinger Probabilistic Weighted Automata. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Anu Singh, C. R. Ramakrishnan 0001, Scott A. Smolka Query-Based Model Checking of Ad Hoc Network Protocols. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jeremy Sproston Strict Divergence for Probabilistic Timed Automata. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christel Baier, Nathalie Bertrand 0001, Marcus Größer The Effect of Tossing Coins in Omega-Automata. Search on Bibsonomy CONCUR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #501 - #600 of 1346 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][>>]
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