The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1966-1974 (15) 1975-1977 (15) 1978-1980 (22) 1981-1982 (22) 1983-1984 (28) 1985-1986 (28) 1987 (24) 1988 (22) 1989 (32) 1990 (33) 1991 (31) 1992 (35) 1993 (45) 1994 (54) 1995 (37) 1996 (42) 1997 (34) 1998 (50) 1999 (59) 2000 (71) 2001 (91) 2002 (110) 2003 (120) 2004 (129) 2005 (158) 2006 (165) 2007 (171) 2008 (166) 2009 (156) 2010 (45) 2011 (30) 2012 (32) 2013 (35) 2014 (34) 2015 (36) 2016 (33) 2017 (52) 2018 (37) 2019 (34) 2020 (25) 2021 (36) 2022 (26) 2023 (34) 2024 (9)
Publication types (Num. hits)
article(632) book(1) incollection(8) inproceedings(1809) phdthesis(13)
Venues (Conferences, Journals, ...)
CoRR(145) ICALP(102) MFCS(72) CSL(71) CONCUR(69) RTA(69) LICS(66) STACS(58) FSTTCS(55) FoSSaCS(51) Theor. Comput. Sci.(42) CADE(41) POPL(40) CAV(37) LPAR(37) PODS(33) More (+10 of total 480)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1109 occurrences of 587 keywords

Results
Found 2463 publication records. Showing 2463 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
68Qing Zhou, Weihao Hu Decidability in Analysis. Search on Bibsonomy Computing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF almost decidable, Decidable
53Dietrich Kuske, Markus Lohrey Decidable Theories of Cayley-Graphs. Search on Bibsonomy STACS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
49Amir Pnueli, Roni Rosner Distributed Reactive Systems Are Hard to Synthesize Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF elementarily decidable, distributed reactive system, propositional specification, nonelementarily decidable, distributed architecture, undecidable, finite-state
47Mikolaj Bojanczyk, Piotr Hoffman Reachability in Unions of Commutative Rewriting Systems Is Decidable. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Topic classification Logic in computer science, rewriting
40Friedrich Otto, Masashi Katsura, Yuji Kobayashi Cross-Sections for Finitely Presented Monoids with Decidable Word Problems. Search on Bibsonomy RTA The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
40Christian Prehofer Decidable Higher-Order Unification Problems. Search on Bibsonomy CADE The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
39Limin Jia 0001, Jianzhou Zhao, Vilhelm Sjöberg, Stephanie Weirich Dependent types and program equivalence. Search on Bibsonomy POPL The full citation details ... 2010 DBLP  DOI  BibTeX  RDF dependent types, program equivalence
39Thomas A. Henzinger, Jean-François Raskin, Pierre-Yves Schobbens The Regular Real-Time Languages. Search on Bibsonomy ICALP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
39Neil D. Jones, Steven S. Muchnick Even Simple Programs are Hard to Analyze. Search on Bibsonomy POPL The full citation details ... 1975 DBLP  DOI  BibTeX  RDF
34Tony Tan On Pebble Automata for Data Languages with Decidable Emptiness Problem. Search on Bibsonomy MFCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
34Barbara F. Csima, Bakhadyr Khoussainov When Is Reachability Intrinsically Decidable?. Search on Bibsonomy Developments in Language Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
34Aharon Abadi, Alexander Moshe Rabinovich, Mooly Sagiv Decidable Fragments of Many-Sorted Logic. Search on Bibsonomy LPAR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
34Thomas Ågotnes, Natasha Alechina Full and relative awareness: a decidable logic for reasoning about knowledge of unawareness. Search on Bibsonomy TARK The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
34Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! Search on Bibsonomy LFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
34Joël Ouaknine, James Worrell 0001 Safety Metric Temporal Logic Is Fully Decidable. Search on Bibsonomy TACAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Nicolas Peltier Representing and Building Models for Decidable Subclasses of Equational Clausal Logic. Search on Bibsonomy J. Autom. Reason. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF resolution, decision procedure, model building, model representation
34Pavel Krcál, Wang Yi 0001 Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata. Search on Bibsonomy TACAS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
34Diego Calvanese, Giuseppe De Giacomo, Moshe Y. Vardi Decidable Containment of Recursive Queries. Search on Bibsonomy ICDT The full citation details ... 2003 DBLP  BibTeX  RDF
34Krysia Broda A Decidable CLDS for Some Propositional Resource Logics. Search on Bibsonomy Computational Logic: Logic Programming and Beyond The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
34Regimantas Pliuskevicius On an omega-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL. Search on Bibsonomy Computational Logic The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
34Manfred Schmidt-Schauß, Klaus U. Schulz Solvability of Context Equations with Two Context Variables is Decidable. Search on Bibsonomy CADE The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
34Jordi Levy Decidable and Undecidable Second-Order Unification Problems. Search on Bibsonomy RTA The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
34Florent Jacquemard Decidable Approximations of Term Rewriting Systems. Search on Bibsonomy RTA The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
34Helmut Seidl Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. Search on Bibsonomy CAAP The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
32Laurent Bienvenu, Wolfgang Merkle Reconciling Data Compression and Kolmogorov Complexity. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32Markus Lohrey, Géraud Sénizergues Theories of HNN-Extensions and Amalgamated Products. Search on Bibsonomy ICALP (2) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
32Bakhadyr Khoussainov, Sasha Rubin Decidability of Term Algebras Extending Partial Algebras. Search on Bibsonomy CSL The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
31Ralf H. Reussner Counter-Constrained Finite State Machines: A New Model for Component Protocols with Resource-Dependencies. Search on Bibsonomy SOFSEM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF software component protocols, finite state machine extension, decidable inclusion check, interoperability, substitutability
31Mihhail Matskin, Enn Tyugu Strategies of Structural Synthesis of Programs. Search on Bibsonomy ASE The full citation details ... 1997 DBLP  DOI  BibTeX  RDF structural program synthesis strategies, deductive program synthesis method, compositional programming, decidable logical calculus, PSPACE complexity, independent subtasks, iteration synthesis, regular data structures, heuristics, programming environments, structured programming, proof search, search efficiency
29Domenico Cantone, Pietro Maugeri, Eugenio G. Omodeo Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
29Bruno Bernardo Un Calcul des Constructions implicite avec sommes dépendantes et à inférence de type décidable. (An implicit Calculus of Constructions with dependent sums and decidable type inference). Search on Bibsonomy 2015   RDF
29Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic. Search on Bibsonomy CONCUR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
29René Vidal, Shawn Schaffert, Omid Shakernia, John Lygeros, Shankar Sastry 0001 Decidable and semi-decidable controller synthesis for classes of discrete time hybrid systems. Search on Bibsonomy CDC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
29Natasha Alechina On a Decidable Generalized Quantifier Logic Corresponding to a Decidable Fragment of First-Order Logic. Search on Bibsonomy J. Log. Lang. Inf. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
29Terrence Millar A Complete, Decidable Theory with Two Decidable Models. Search on Bibsonomy J. Symb. Log. The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
28Kenneth L. Knowles, Cormac Flanagan Compositional reasoning and decidable checking for dependent contract types. Search on Bibsonomy PLPV The full citation details ... 2009 DBLP  DOI  BibTeX  RDF refinement types, abstraction, dependent types, compositional reasoning
28Jacques Duparc, Alessandro Facchini, Filip Murlak Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata. Search on Bibsonomy CSL The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
28Albert Atserias, Mark Weyer Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. Search on Bibsonomy CSL The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
28Pascal Fontaine Combinations of Theories for Decidable Fragments of First-Order Logic. Search on Bibsonomy FroCoS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
28Alberto Casagrande, Pietro Corvaja, Carla Piazza, Bud Mishra Decidable Compositions of O-Minimal Automata. Search on Bibsonomy ATVA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Peter Habermehl, Radu Iosif, Tomás Vojnar What Else Is Decidable about Integer Arrays?. Search on Bibsonomy FoSSaCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Matthew J. Patitz, Scott M. Summers Self-assembly of Decidable Sets. Search on Bibsonomy UC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Norihiro Kamide Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials. Search on Bibsonomy JELIA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Yoshiharu Kojima, Masahiko Sakai Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems. Search on Bibsonomy RTA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Brad Lushman, Gordon V. Cormack A larger decidable semiunification problem. Search on Bibsonomy PPDP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF acyclic semiunification, semiunification, decidability
28Francesco Calimeri, Susanna Cozza, Giovambattista Ianni Decidable Fragments of Logic Programming with Value Invention. Search on Bibsonomy JELIA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Pietro di Lena Decidable Properties for Regular Cellular Automata. Search on Bibsonomy IFIP TCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Dietrich Kuske, Markus Lohrey Decidable First-Order Theories of One-Step Rewriting in Trace Monoids. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Manfred Schmidt-Schauß Decidable Variants of Higher-Order Unification. Search on Bibsonomy Mechanizing Mathematical Reasoning The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Jon A. Solworth, Robert H. Sloan A Layered Design of Discretionary Access Controls with Decidable Safety Properties. Search on Bibsonomy S&P The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
28Viktor Kuncak, Martin C. Rinard Structural Subtyping of Non-Recursive Types is Decidable. Search on Bibsonomy LICS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
28Jesse D. Bingham, Anne Condon, Alan J. Hu Toward a decidable notion of sequential consistency. Search on Bibsonomy SPAA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF shared memory systems, memory model, sequential consistency
28Michaël Adélaïde, Olivier F. Roux A Class of Decidable Parametric Hybrid Systems. Search on Bibsonomy AMAST The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
28Thomas Colcombet On Families of Graphs Having a Decidable First Order Theory with Reachability. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
28Volker Diekert, Anca Muscholl Solvability of Equations in Free Partially Commutative Groups Is Decidable. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
28Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan, Richard A. Kemmerer Conter Machines: Decidable Properties and Applications to Verification Problems. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
28Paliath Narendran, Michaël Rusinowitch The Theory of Total Unary RPO Is Decidable. Search on Bibsonomy Computational Logic The full citation details ... 2000 DBLP  DOI  BibTeX  RDF recursive path ordering, ground reducibility, ordered rewriting, tree automata, first-order theory
28Yoram Hirshfeld, Alexander Moshe Rabinovich A Framework for Decidable Metrical Logics. Search on Bibsonomy ICALP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
28Adriana Popovici, Dan Popovici delta-Uniformly Decidable Sets and Turing Machines. Search on Bibsonomy FCT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
28Franz Baader, Ralf Molitor, Stephan Tobies Tractable and Decidable Fragments of Conceptual Graphs. Search on Bibsonomy ICCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
28Reinhard Pichler Extending Decidable Clause Classes via Constraints. Search on Bibsonomy FTP (LNCS Selection) The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
28Sergei G. Vorobyov The "Hardest" Natural Decidable Theory. Search on Bibsonomy LICS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
28Erich Grädel, Martin Otto 0001, Eric Rosen Two-Variable Logic with Counting is Decidable. Search on Bibsonomy LICS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
28Petr Jancar Bisimulation Equivalence is Decidable for One-Counter Processes. Search on Bibsonomy ICALP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
28D. J. B. Bosscher, W. O. David Griffioen Regularity for a Large Class of Context-Free Processes is Decidable. Search on Bibsonomy ICALP The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
28Christoph Weidenbach Unification in Pseudo-Linear Sort Theories is Decidable. Search on Bibsonomy CADE The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
28Søren Christensen Distributed Bisimularity is Decidable for a Class of Infinite State-Space Systems. Search on Bibsonomy CONCUR The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
28Sophie Tison Fair Termination is Decidable for Ground Systems. Search on Bibsonomy RTA The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
28Paavo Turakainen The Equivalence of DGSM Replications on Q-Rational Languages is Decidable. Search on Bibsonomy ICALP The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
28Jeffrey F. Naughton, Yehoshua Sagiv A Decidable Class of Bounded Recursions. Search on Bibsonomy PODS The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
28Karel Culík II, Juhani Karhumäki The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable. Search on Bibsonomy MFCS The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
28Jacob Gonczaroski Decidable Properties of Monadic Recursive Schemas with a Depth Parameter. Search on Bibsonomy CAAP The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
28Edward A. Ashcroft, Zohar Manna, Amir Pnueli Decidable Properties of Monadic Functional Schemas. Search on Bibsonomy J. ACM The full citation details ... 1973 DBLP  DOI  BibTeX  RDF
26Laurent Doyen 0001, Gilles Geeraerts, Jean-François Raskin, Julien Reichert Realizability of Real-Time Logics. Search on Bibsonomy FORMATS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Salvatore La Torre, P. Madhusudan, Gennaro Parlato Context-Bounded Analysis of Concurrent Queue Systems. Search on Bibsonomy TACAS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Piotr Hoffman Unions of Equational Monadic Theories. Search on Bibsonomy RTA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
26Efrat Jaeger, Nissim Francez, Shuly Wintner Unification Grammars and Off-Line Parsability. Search on Bibsonomy J. Log. Lang. Inf. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF off-line parsability, parsing termination, unification grammars
26Yoshihito Toyama Reduction Strategies for Left-Linear Term Rewriting Systems. Search on Bibsonomy Processes, Terms and Cycles The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Venkatesh Mysore, Amir Pnueli Refining the Undecidability Frontier of Hybrid Automata. Search on Bibsonomy FSTTCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Boris Motik, Ulrike Sattler, Rudi Studer Query Answering for OWL-DL with Rules. Search on Bibsonomy ISWC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26Olivier Serre Games with Winning Conditions of High Borel Complexity. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Borel Complexity, Pushdown Automata, Two-player Games
26Lila Kari, Stavros Konstantinidis, Petr Sosík Bond-Free Languages: Formalizations, Maximality and Construction Methods. Search on Bibsonomy DNA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26Takashi Nagaya, Yoshihito Toyama Decidability for Left-Linaer Growing Term Rewriting Systems. Search on Bibsonomy RTA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
26Andrea Sattler-Klein New Undecidablility Results for Finitely Presented Monoids. Search on Bibsonomy RTA The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
26Isabelle Fagnot On the Subword Equivalence Problem for Infinite Words. Search on Bibsonomy STACS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
26Ke Wang Some Positive Results for Boundedness of Multiple Recursive Rules. Search on Bibsonomy ICDT The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
26Mahesh Girkar, Robert Moll New Results on the Analysis of Concurrent Systems with an Infinite Number of Processes. Search on Bibsonomy CONCUR The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
26Oscar H. Ibarra, Tao Jiang 0001, Nicholas Q. Trân, Hui Wang 0008 New Decidability Results Concerning Two-way Counter Machines and Applications. Search on Bibsonomy ICALP The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
26Ravindran Kannan, Richard J. Lipton Polynomial-time algorithm for the orbit problem. Search on Bibsonomy J. ACM The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
26Mohamed G. Gouda, Louis E. Rosier Communicating Finite State Machines with Priority Channnels. Search on Bibsonomy ICALP The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
24I. D. Zaslavsky Some Criteria of Decidability for Axiomatic Systems in Three-Valued Logic. Search on Bibsonomy TbiLLC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF three-valued predicate, Luk-theory, Luk-consistent theory, Lukcomplete theory, Luk-decidable theory
24Ian Pratt-Hartmann Fragments of Language. Search on Bibsonomy J. Log. Lang. Inf. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF decidable fragments, computational complexity, semantics, logic
24Susan Landau 0001 Simplification of Nested Radicals Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF radical simplification, nested radicals, equivalent expression, minimum nesting depth, decidable, minimal polynomial
24Martín Abadi, Joseph Y. Halpern Decidability and Expressiveness for First-Order Logics of Probability (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF unary predicates, validity problem, binary predicate, elementary analysis, function symbols, probability, language, reasoning, first-order logics, decidable, expressiveness, domain, possible worlds
24Leszek Pacholski, Wieslaw Szwast The 0-1 Law Fails for the Class of Existential Second Order Gödel Sentences with Equality Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF prenex first-order sentences, second order Godel sentences, 0-1 law, Bernays-Schonfinkel, Ackermann prefix classes, decidable cases
24Russell Impagliazzo, Gábor Tardos Decision Versus Search Problems in Super-Polynomial Time Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF X-search problem, super-polynomial time, decidable, search problems, decision problems, parallel complexity
21Ken Kaneiwa, Philip H. P. Nguyen Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring. Search on Bibsonomy ISWC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
21Thomas Place, Luc Segoufin A Decidable Characterization of Locally Testable Tree Languages. Search on Bibsonomy ICALP (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
21Raphaël Bailly, François Denis Absolute Convergence of Rational Series Is Semi-decidable. Search on Bibsonomy LATA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
21Yuliya Lierler, Vladimir Lifschitz One More Decidable Class of Finitely Ground Programs. Search on Bibsonomy ICLP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 2463 (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