The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Paul Gastin" ( http://dblp.L3S.de/Authors/Paul_Gastin )

URL (Homepage):  http://www.lsv.ens-cachan.fr/~gastin/  Author page on DBLP  Author page in RDF  Community of Paul Gastin in ASPL-2

Publication years (Num. hits)
1990-1995 (17) 1996-2001 (16) 2002-2004 (15) 2005-2007 (15) 2008-2011 (15) 2012-2014 (19) 2015-2018 (22) 2019 (7)
Publication types (Num. hits)
article(52) incollection(2) inproceedings(70) proceedings(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 29 occurrences of 17 keywords

Results
Found 127 publication records. Showing 126 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Paul Gastin, Amaldev Manuel, R. Govind Logics for Reversible Regular Languages and Semigroups with Involution. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna Timed Systems through the Lens of Logic. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Paul Gastin, Sayan Mukherjee 0002, B. Srivathsan Fast algorithms for handling diagonal constraints in timed automata. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Benedikt Bollig, Paul Gastin Non-Sequential Theory of Distributed Systems. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Manfred Droste, Paul Gastin Aperiodic Weighted Automata and Weighted First-Order Logic. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Paul Gastin, Sayan Mukherjee 0002, B. Srivathsan Fast Algorithms for Handling Diagonal Constraints in Timed Automata. Search on Bibsonomy CAV (1) The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Paul Gastin Modular Descriptions of Regular Functions. Search on Bibsonomy CAI The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1C. Aiswarya, Benedikt Bollig, Paul Gastin An automata-theoretic approach to the verification of distributed algorithms. Search on Bibsonomy Inf. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Marie Fortin, Paul Gastin It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Paul Gastin, Sayan Mukherjee 0002, B. Srivathsan Reachability in timed automata with diagonal constraints. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Benedikt Bollig, Marie Fortin, Paul Gastin Gossiping in Message-Passing Systems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Vrunda Dave, Paul Gastin, Krishna Shankara Narayanan Regular Transducer Expressions for Regular Transformations. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Paul Gastin, Shankara Narayanan Krishna Unambiguous Forest Factorization. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Paul Gastin, Benjamin Monmege A unifying survey on weighted logics and weighted automata - Core weighted logic: minimal and versatile specification of quantitative properties. Search on Bibsonomy Soft Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1S. Akshay, Paul Gastin, Shankara Narayanan Krishna Analyzing Timed Systems Using Tree Automata. Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Marie Fortin, Paul Gastin It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Sayan Mukherjee 0002, B. Srivathsan Reachability in Timed Automata with Diagonal Constraints. Search on Bibsonomy CONCUR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Marie Fortin, Paul Gastin Communicating Finite-State Machines and Two-Variable Logic. Search on Bibsonomy STACS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vrunda Dave, Paul Gastin, Shankara Narayanan Krishna Regular Transducer Expressions for Regular Transformations. Search on Bibsonomy LICS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Marie Fortin, Paul Gastin Communicating Finite-State Machines and Two-Variable Logic. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar Towards an Efficient Tree Automata based technique for Timed Systems. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1S. Akshay, Paul Gastin, Shankara Narayanan Krishna, Ilias Sarkar Towards an Efficient Tree Automata Based Technique for Timed Systems. Search on Bibsonomy CONCUR The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1S. Akshay, Paul Gastin, Shankara Narayanan Krishna Analyzing Timed Systems Using Tree Automata. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1C. Aiswarya, Paul Gastin, Prakash Saivasan Nested Words for Order-2 Pushdown Systems. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Marie Fortin, Paul Gastin Verification of Parameterized Communicating Automata via Split-Width. Search on Bibsonomy FoSSaCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1S. Akshay, Paul Gastin, Shankara Narayanan Krishna Analyzing Timed Systems Using Tree Automata. Search on Bibsonomy CONCUR The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1C. Aiswarya, Benedikt Bollig, Paul Gastin An Automata-Theoretic Approach to the Verification of Distributed Algorithms. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar Checking conformance for time-constrained scenario-based specifications. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1C. Aiswarya, Benedikt Bollig, Paul Gastin An Automata-Theoretic Approach to the Verification of Distributed Algorithms. Search on Bibsonomy CONCUR The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun Pebble Weighted Automata and Weighted Logics. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, C. Aiswarya, Paul Gastin, Marc Zeitoun Temporal logics for concurrent recursive programs: Satisfiability and model checking. Search on Bibsonomy J. Applied Logic The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar Distributed Timed Automata with Independently Evolving Clocks. Search on Bibsonomy Fundam. Inform. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Benjamin Monmege Adding pebbles to weighted automata: Easy specification & efficient evaluation. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1C. Aiswarya, Paul Gastin, K. Narayan Kumar Verifying Communicating Multi-pushdown Systems via Split-Width. Search on Bibsonomy ATVA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1C. Aiswarya, Paul Gastin, K. Narayan Kumar Controllers for the Verification of Communicating Multi-pushdown Systems. Search on Bibsonomy CONCUR The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Paul Gastin, Jana Schubert Parameterized Verification of Communicating Automata under Context Bounds. Search on Bibsonomy RP The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Paul Gastin, Akshay Kumar Parameterized Communicating Automata: Complementation and Model Checking. Search on Bibsonomy FSTTCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1C. Aiswarya, Paul Gastin Reasoning About Distributed Systems: WYSIWYG (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun Logical characterization of weighted pebble walking automata. Search on Bibsonomy CSL-LICS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1S. Akshay, Benedikt Bollig, Paul Gastin Event clock message passing automata: a logical characterization and an emptiness checking algorithm. Search on Bibsonomy Formal Methods in System Design The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Nathalie Sznajder Fair Synthesis for Asynchronous Distributed Systems. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Paul Gastin, Benjamin Monmege Weighted Specifications over Nested Words. Search on Bibsonomy FoSSaCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Nathalie Sznajder Decidability of well-connectedness for distributed synthesis. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Stéphane Demri, Paul Gastin Specification and Verification using Temporal Logics. Search on Bibsonomy Modern Applications of Automata Theory The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun A Probabilistic Kleene Theorem. Search on Bibsonomy ATVA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar Model Checking Languages of Data Words. Search on Bibsonomy FoSSaCS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar MSO Decidability of Multi-Pushdown Systems via Split-Width. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Benjamin Monmege Adding Pebbles to Weighted Automata. Search on Bibsonomy CIAA The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. Search on Bibsonomy MFCS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Dietrich Kuske Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. Search on Bibsonomy Inf. Comput. 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
1Christel Baier, Manfred Droste, Paul Gastin, Kim Guldstrand Larsen 10031 Executive Summary - Quantitative Models: Expressiveness and Analysis. Search on Bibsonomy Quantitative Models: Expressiveness and Analysis The full citation details ... 2010 DBLP  BibTeX  RDF
1Christel Baier, Manfred Droste, Paul Gastin, Kim Guldstrand Larsen 10031 Abstracts Collection - Quantitative Models: Expressiveness and Analysis. Search on Bibsonomy Quantitative Models: Expressiveness and Analysis The full citation details ... 2010 DBLP  BibTeX  RDF
1Christel Baier, Manfred Droste, Paul Gastin, Kim Guldstrand Larsen (eds.) Quantitative Models: Expressiveness and Analysis, 17.01. - 22.01.2010 Search on Bibsonomy Quantitative Models: Expressiveness and Analysis The full citation details ... 2010 DBLP  BibTeX  RDF
1Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun Pebble Weighted Automata and Transitive Closure Logics. Search on Bibsonomy ICALP (2) The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar Model checking time-constrained scenario-based specifications. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Nathalie Sznajder, Marc Zeitoun Distributed synthesis for well-connected architectures. Search on Bibsonomy Formal Methods in System Design The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Synthesis problem, Synchronous architectures, Distributed systems
1Thomas Chatain, Paul Gastin, Nathalie Sznajder Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. Search on Bibsonomy SOFSEM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Distributed synthesis, Asynchronous systems
1Benedikt Bollig, Paul Gastin Weighted versus Probabilistic Logics. Search on Bibsonomy Developments in Language Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Manfred Droste, Paul Gastin On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Aperiodic languages, Star-free languages, Traces, Semiring, Formal power series, Weighted automata
1Volker Diekert, Paul Gastin, Manfred Kufleitner A Survey on Small Fragments of First-Order Logic over Finite Words. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Paul Gastin First-order definable languages. Search on Bibsonomy Logic and Automata The full citation details ... 2008 DBLP  BibTeX  RDF
1S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar Distributed Timed Automata with Independently Evolving Clocks. Search on Bibsonomy CONCUR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Béatrice Bérard, Paul Gastin, Antoine Petit 0001 Timed substitutions for regular signal-event languages. Search on Bibsonomy Formal Methods in System Design The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Signal-event word, Refinement, Abstraction, Timed automata, Substitution
1Paul Gastin, Dietrich Kuske Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces. Search on Bibsonomy Fundam. Inform. The full citation details ... 2007 DBLP  BibTeX  RDF
1Manfred Droste, Paul Gastin Weighted automata and weighted logics. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Pierre Moro Minimal Counterexample Generation for SPIN. Search on Bibsonomy SPIN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1S. Akshay, Benedikt Bollig, Paul Gastin Automata and Logics for Timed Message Sequence Charts. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar Local Testing of Message Sequence Charts Is Difficult. Search on Bibsonomy FCT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Paul Gastin Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Search on Bibsonomy Inf. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Siva Anantharaman, Paul Gastin, Gaétan Hains, John Mullins, Michaël Rusinowitch Editorial. Search on Bibsonomy Journal of Automata, Languages and Combinatorics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Paul Gastin From local to global temporal logics over Mazurkiewicz traces. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Puneet Bhateja, Paul Gastin, Madhavan Mukund A Fresh Look at Testing for Asynchronous Communication. Search on Bibsonomy ATVA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Béatrice Bérard, Paul Gastin, Antoine Petit 0001 Refinements and Abstractions of Signal-Event (Timed) Languages. Search on Bibsonomy FORMATS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Béatrice Bérard, Paul Gastin, Antoine Petit 0001 Intersection of Regular Signal-Event (Timed) Languages. Search on Bibsonomy FORMATS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Nathalie Sznajder, Marc Zeitoun Distributed Synthesis for Well-Connected Architectures. Search on Bibsonomy FSTTCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Dietrich Kuske Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. Search on Bibsonomy CONCUR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Manfred Droste, Paul Gastin Weighted Automata and Weighted Logics. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Paul Gastin Local temporal logic is expressively complete for cograph dependence alphabets. Search on Bibsonomy Inf. Comput. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Michael W. Mislove A simple process algebra based on atomic actions with resources. Search on Bibsonomy Mathematical Structures in Computer Science The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Pierre Moro, Marc Zeitoun Minimization of Counterexamples in SPIN. Search on Bibsonomy SPIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Benjamin Lerman, Marc Zeitoun Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems. Search on Bibsonomy FSTTCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Paul Gastin Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF concurrency, Temporal logics, Mazurkiewicz traces
1Paul Gastin, Benjamin Lerman, Marc Zeitoun Distributed Games and Distributed Control for Asynchronous Systems. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Distributed game, distributed control, distributed strategy
1Paul Gastin, Dietrich Kuske Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. Search on Bibsonomy CONCUR The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Denis Oddoux LTL with Past and Two-Way Very-Weak Alternating Automata. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Madhavan Mukund, K. Narayan Kumar Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF concurrency, Temporal logics, Mazurkiewicz traces
1Volker Diekert, Paul Gastin LTL Is Expressively Complete for Mazurkiewicz Traces. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Manfred Droste, Paul Gastin Editorial. Search on Bibsonomy Journal of Automata, Languages and Combinatorics The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Michael W. Mislove A truly concurrent semantics for a process algebra using resource pomsets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Dan Teodosiu 0001 Resource traces: a domain for processes sharing exclusive resources. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Paul Gastin Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids. Search on Bibsonomy Formal and Natural Computing The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Madhavan Mukund An Elementary Expressively Complete Temporal Logic for Mazurkiewicz Traces. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF concurrency, Temporal logics, Mazurkiewicz traces
1Fabrice Derepas, Paul Gastin Model Checking Systems of Replicated Processes with Spin. Search on Bibsonomy SPIN The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Paul Gastin, Denis Oddoux Fast LTL to Büchi Automata Translation. Search on Bibsonomy CAV The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Paul Gastin Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets. Search on Bibsonomy LPAR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF concurrency, Temporal logics, Mazurkiewicz traces
1Fabrice Derepas, Paul Gastin, David Plainfossé Avoiding State Explosion for Distributed Systems with Timestamps. Search on Bibsonomy FME The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Manfred Droste, Paul Gastin, Dietrich Kuske Asynchronous cellular automata for pomsets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Volker Diekert, Paul Gastin LTL Is Expressively Complete for Mazurkiewicz Traces. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Manfred Droste, Paul Gastin The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables. Search on Bibsonomy Inf. Comput. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 126 (100 per page; Change: )
Pages: [1][2][>>]
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