|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 705 occurrences of 446 keywords
|
|
|
Results
Found 1333 publication records. Showing 1333 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
126 | Alexei G. Myasnikov |
Generic Complexity of Undecidable Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings, pp. 407-417, 2007, Springer, 978-3-540-74509-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
41 | Olivier Finkel |
Undecidable Problems About Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems, 4th International Conference, FORMATS 2006, Paris, France, September 25-27, 2006, Proceedings, pp. 187-199, 2006, Springer, 3-540-45026-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
41 | Paliath Narendran, Jonathan Stillman |
It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings, pp. 348-359, 1989, Springer, 3-540-50840-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
41 | Juris Hartmanis |
On the Complexity of Undecidable Problems in Automata Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 16(1), pp. 160-167, 1969. The full citation details ...](Pics/full.jpeg) |
1969 |
DBLP DOI BibTeX RDF |
|
39 | Frank Wolter, Michael Zakharyaschev |
Undecidability of the unification and admissibility problems for modal and description logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 9(4), pp. 25:1-25:20, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
admissible rule, description logic, decidability, Unification, hybrid logic |
33 | Maurice Margenstern |
The Periodic Domino Problem Is Undecidable in the Hyperbolic Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings, pp. 154-165, 2009, Springer, 978-3-642-04419-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
hyperbolic plane, periodic tiling problem, tilings, undecidability |
33 | Michal Kunc |
The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings, pp. 365-375, 2007, Springer, 978-3-540-74239-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Pavel Krcál, Wang Yi 0001 |
Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings, pp. 236-250, 2004, Springer, 3-540-21299-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Vincent D. Blondel, Vincent Canterini |
Undecidable Problems for Probabilistic Automata of Fixed Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 36(3), pp. 231-245, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Eugene Asarin, Gerardo Schneider |
Widening the Boundary between Decidable and Undecidable Hybrid Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings, pp. 193-208, 2002, Springer, 3-540-44043-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Juhani Karhumäki, Leonid P. Lisovik |
A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings, pp. 388-395, 2001, Springer, 3-540-41695-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Paliath Narendran, Friedrich Otto |
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings, pp. 638-648, 1997, Springer, 3-540-63165-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
matching, unification, equational theory, string-rewriting systems |
33 | Géraud Sénizergues |
Some Undecidable Termination Problems for Semi-Thue Systems (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, Proceedings, pp. 434, 1993, Springer, 3-540-56868-9. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
33 | Max Dauchet |
Termination of Rewriting is Undecidable in the One-Rule Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1988, MFCS'88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings, pp. 262-270, 1988, Springer, 3-540-50110-X. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
31 | Paul Bell, Igor Potapov |
Lowering Undecidability Bounds for Decision Questions in Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings, pp. 375-385, 2006, Springer, 3-540-35428-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
vector reachability, matrix semigroups, piecewise linear maps, membership, Theory of computing |
31 | Thierry Joly |
Encoding of the Halting Problem into the Monster Type & Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TLCA ![In: Typed Lambda Calculi and Applications, 6th International Conference, TLCA 2003, Valencia, Spain, June 10-12, 2003, Proceedings., pp. 153-166, 2003, Springer, 3-540-40332-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Mohamed G. Gouda, Louis E. Rosier |
Communicating Finite State Machines with Priority Channnels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium, July 16-20, 1984, Proceedings, pp. 209-221, 1984, Springer, 3-540-13345-3. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
31 | Neil D. Jones, Steven S. Muchnick |
Even Simple Programs are Hard to Analyze. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Second ACM Symposium on Principles of Programming Languages, Palo Alto, California, USA, January 1975, pp. 106-118, 1975, ACM Press. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
25 | Guillem Godoy, Hugo Hernández |
Undecidable properties of flat term rewrite systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 20(2), pp. 187-205, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 16S15, 68Q42 |
25 | Eero Lehtonen |
An Undecidable Permutation of the Natural Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings, pp. 120-126, 2009, Springer, 978-3-642-04419-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Permutation, Undecidability |
25 | Davide Bresolin, Dario Della Monica, Valentin Goranko, Angelo Montanari, Guido Sciavicco |
Decidable and Undecidable Fragments of Halpern and Shoham's Interval Temporal Logic: Towards a Complete Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings, pp. 590-604, 2008, Springer, 978-3-540-89438-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Victor L. Selivanov |
A Useful Undecidable Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 685-694, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
discrete weak semilattice, partition, theory, reducibility, undecidability, Semilattice |
25 | Ian M. Hodkinson, Frank Wolter, Michael Zakharyaschev |
Decidable and Undecidable Fragments of First-Order Branching Temporal Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings, pp. 393-402, 2002, IEEE Computer Society, 0-7695-1483-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Vladimir A. Zakharov |
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCU ![In: Machines, Computations, and Universality, Third International Conference, MCU 2001, Chisinau, Moldova, May 23-27, 2001, Proceedings, pp. 133-152, 2001, Springer, 3-540-42121-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Philippe Schnoebelen |
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACS ![In: Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001, Proceedings, pp. 385-399, 2001, Springer, 3-540-42736-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Steffen Hölldobler, Dietrich Kuske |
The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France, November 11-12, 2000, Proceedings, pp. 436-450, 2000, Springer. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Mark Harman, Chris Fox, Robert M. Hierons, David W. Binkley, Sebastian Danicic |
Program Simplification as a Means of Approximating Undecidable Propositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPC ![In: 7th International Workshop on Program Comprehension (IWPC '99), May 5-7, 1999 - Pittsburgh, PA, USA, pp. 208-217, 1999, IEEE Computer Society, 0-7695-0179-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Testing, Transformation, Slicing |
25 | Jordi Levy |
Decidable and Undecidable Second-Order Unification Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings, pp. 47-60, 1998, Springer, 3-540-64301-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
25 | Sergei G. Vorobyov |
The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings, pp. 254-268, 1997, Springer, 3-540-62950-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
25 | Ralf Treinen |
The First-Order Theory of One-Step Rewriting is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 7th International Conference, RTA-96, New Brunswick, NJ, USA, July 27-30, 1996, Proceedings, pp. 276-286, 1996, Springer, 3-540-61464-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
25 | Parosh Aziz Abdulla, Bengt Jonsson 0001 |
Undecidable Verification Problems for Programs with Unreliable Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 316-327, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Tao Jiang 0001, Arto Salomaa, Kai Salomaa, Sheng Yu 0001 |
Inclusion is Undecidable for Pattern Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings, pp. 301-312, 1993, Springer, 3-540-56939-1. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
inclusion problems, patterns, decidability, pattern languages, equivalence problems |
25 | Benjamin C. Pierce |
Bounded Quantification is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Nineteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Albuquerque, New Mexico, USA, January 19-22, 1992, pp. 305-315, 1992, ACM Press, 0-89791-453-8. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
25 | Ivan Korec |
Undecidable Problems Concerning Generalized Pascal Triangles of Commutative Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings, pp. 458-466, 1986, Springer, 3-540-16783-8. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
25 | Li Miao, Da-Fang Zhang |
A New Proof for the Undecidability of Context-Sensitive Synchronization-Sensitive Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCST ![In: Fifth International Conference on Frontier of Computer Science and Technology, FCST 2010, Changchun, Jilin Province, China, August 18-22, 2010, pp. 291-296, 2010, IEEE Computer Society, 978-0-7695-4139-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
concurrent interprocedural program analysis, synchronization-sensitive analysis, undecidable problem, context-sensitive analysis |
25 | Wilfried Sieg |
On mind & Turing's machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nat. Comput. ![In: Nat. Comput. 6(2), pp. 187-205, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
absolutely unsolvable (undecidable), axiom of infinity, Church’s Thesis, Diophantine problem, finite machine, general recursive function, mechanical computability, objective mathematics, subjective mathematics, Turing machine |
25 | Arthur Charlesworth |
The undecidability of associativity and commutativity analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 24(5), pp. 554-565, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Associative function, commutative function, loop program, recursively enumerable, reduction, recursive, sequence, scan, undecidable, parallel prefix, primitive recursive |
25 | Martin F. van Bommel, Grant E. Weddell |
Reasoning About Equations and Functional Dependencies on Complex Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 6(3), pp. 455-469, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
complex object types, property value path, property paths, property value navigation, directed labeled graph, equational constraint, stratification condition, data structures, query processing, database management systems, query languages, query language, query languages, object-oriented databases, directed graphs, reasoning, database theory, functional dependencies, decision procedures, conjunctive queries, undecidable, complex objects, semantic data models, object-oriented data models, equations, constraint theory, constraint theory, constraint language |
25 | Jean Vuillemin |
Exact Real Computer Arithmetic with Continued Fractions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 39(8), pp. 1087-1105, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
exact real computer arithmetic, computable real numbers, undecidable comparison, integer division, infinite 1/0, undefined 0/0 numbers, algebraic algorithm, transcendental algorithm, Gauss, LeLisp, products, digital arithmetic, positional, exponentials, number theory, special functions, continued fractions, arithmetic operations, logarithms, sums, trigonometric functions |
25 | Amir Pnueli, Roni Rosner |
Distributed Reactive Systems Are Hard to Synthesize ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 746-757, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
elementarily decidable, distributed reactive system, propositional specification, nonelementarily decidable, distributed architecture, undecidable, finite-state |
25 | Samuel R. Buss, Christos H. Papadimitriou, John N. Tsitsiklis |
On the Predictability of Coupled Automata: An Allegory about Chaos ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 788-793, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
coupled automata, symmetric global control, undecidable problem, complexity, predictability, chaos, dichotomy |
25 | John H. Reif, J. D. Tygar, Akitoshi Yoshida |
The Computability and Complexity of Optical Beam Tracing ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 106-114, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
optical models, refractive surfaces, undecidable problem, PSPACE-hard problem, optical beam tracing, ray-tracing problem, reflective surfaces, incident angle, complexity, computability |
25 | Anne Condon, Richard J. Lipton |
On the Complexity of Space Bounded Interactive Proofs (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 462-467, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
space bounded interactive proofs, finite-state verifiers, Markov chains, finite-state machines, upper bound, undecidable, interactive proof systems, recursively enumerable language |
25 | Lenore Blum, Mike Shub, Steve Smale |
On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 387-397, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
universal machines, partial recursive functions, undecidable sets, foundational issues, NP completeness, numerical analysis, theory of computation, recursive functions, real numbers |
23 | Paul Bell, Igor Potapov |
The Identity Correspondence Problem and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 657-667, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Fernando Rosa-Velardo, David de Frutos-Escrig |
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Petri Nets ![In: Applications and Theory of Petri Nets, 30th International Conference, PETRI NETS 2009, Paris, France, June 22-26, 2009. Proceedings, pp. 63-82, 2009, Springer, 978-3-642-02423-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Stefan Wehr, Peter Thiemann 0001 |
On the Decidability of Subtyping with Bounded Existential Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems, 7th Asian Symposium, APLAS 2009, Seoul, Korea, December 14-16, 2009. Proceedings, pp. 111-127, 2009, Springer, 978-3-642-10671-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Nicolas Ollinger |
Tiling the Plane with a Fixed Number of Polyominoes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings, pp. 638-647, 2009, Springer, 978-3-642-00981-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Mohamed Faouzi Atig, Tayssir Touili |
Verifying Parallel Programs with Dynamic Communication Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009. Proceedings, pp. 145-154, 2009, Springer, 978-3-642-02978-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Alberto Bertoni, Christian Choffrut, Beatrice Palano |
Context-Free Grammars and XML Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 10th International Conference, DLT 2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings, pp. 108-119, 2006, Springer, 3-540-35428-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, James Worrell 0001 |
Decidability and Complexity Results for Timed Automata via Channel Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 1089-1101, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Boris Konev, Frank Wolter, Michael Zakharyaschev |
Temporal Logics over Transitive States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-20, 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005, Proceedings, pp. 182-203, 2005, Springer, 3-540-28005-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
23 | Malgorzata Moczurad, Wlodzimierz Moczurad |
Some Open Problems in Decidability of Brick (Labelled Polyomino) Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings, pp. 72-81, 2004, Springer, 3-540-22856-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
23 | Gösta Grahne, Alex Thomo |
Query containment and rewriting using views for regular path queries under constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA, pp. 111-122, 2003, ACM, 1-58113-670-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
23 | Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus |
On the Decidability of Self-Assembly of Infinite Ribbons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 530-537, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Mitsuharu Yamamoto, Jean-Marie Cottin, Masami Hagiya |
Decidability of Safety Properties of Timed Multiset Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTRTFT ![In: Formal Techniques in Real-Time and Fault-Tolerant Systems, 7th International Symposium, FTRTFT 2002, Co-sponsored by IFIP WG 2.2, Oldenburg, Germany, September 9-12, 2002, Proceedings, pp. 165-184, 2002, Springer, 3-540-44165-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
real-time systems, timed automata, decidability, timed Petri nets |
23 | Parosh Aziz Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson 0001 |
Reasoning about Probabilistic Lossy Channel Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings, pp. 320-333, 2000, Springer, 3-540-67897-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
23 | Erich Grädel, Martin Otto 0001, Eric Rosen |
Undecidability Results on Two-Variable Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 249-260, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
23 | Tero Harju, Juhani Karhumäki, Daniel Krob |
Remarks on Generalized Post Correspondence Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings, pp. 39-48, 1996, Springer, 3-540-60922-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Serge Abiteboul, Richard Hull 0001 |
Data Functions, Datalog and Negation (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, June 1-3, 1988., pp. 143-153, 1988, ACM Press, 978-0-89791-268-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
DAPLEX, DATALOG |
18 | Matthew Fox |
On Formally Undecidable Traits of Intelligent Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.09500, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Ken-etsu Fujita, Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski |
The existential fragment of second-order propositional intuitionistic logic is undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Non Class. Logics ![In: J. Appl. Non Class. Logics 34(1), pp. 55-74, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Juvenal Murwanashyaka |
Weak essentially undecidable theories of concatenation, part II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 63(3-4), pp. 353-390, May 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Shuo Ding, Qirun Zhang |
Witnessability of Undecidable Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 7(POPL), pp. 982-1002, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Maurice Margenstern |
The Domino Problem of the Hyperbolic Plane Is Undecidable: New Proof. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex Syst. ![In: Complex Syst. 32(1), pp. 19-56, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Roland Guttenberg |
Verification of Population Protocols with Unordered Data is undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.10159, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Fabian Mitterwallner, Aart Middeldorp, René Thiemann |
Linear Termination over N is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.14805, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann 0002 |
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.16699, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Benjamin Hellouin de Menibus, Victor H. Lutfalla, Camille Noûs |
The Domino problem is undecidable on every rhombus subshift. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.12086, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Christopher J. Eagle, Clovis Hamel, Sandra Müller, Franklin D. Tall |
An undecidable extension of Morley's theorem on the number of countable models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 174(9), pp. 103317, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Rachel Greenfeld, Terence Tao |
Undecidable Translational Tilings with Only Two Tiles, or One Nonabelian Tile. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 70(4), pp. 1652-1706, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Arkadiy Skopenkov |
Extendability of Simplicial Maps is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 69(1), pp. 250-259, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Laura Kovács, Anton Varonka |
What Else is Undecidable About Loops? ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAMiCS ![In: Relational and Algebraic Methods in Computer Science - 20th International Conference, RAMiCS 2023, Augsburg, Germany, April 3-6, 2023, Proceedings, pp. 176-193, 2023, Springer, 978-3-031-28082-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Benjamin Hellouin de Menibus, Victor H. Lutfalla, Camille Noûs |
The Domino Problem Is Undecidable on Every Rhombus Subshift. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DLT ![In: Developments in Language Theory - 27th International Conference, DLT 2023, Umeå, Sweden, June 12-16, 2023, Proceedings, pp. 100-112, 2023, Springer, 978-3-031-33263-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Jonathan Geller |
Baba is You is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoG ![In: IEEE Conference on Games, CoG 2023, Boston, MA, USA, August 21-24, 2023, pp. 1-8, 2023, IEEE, 979-8-3503-2277-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Steve Hanneke, Liu Yang 0001 |
Bandit Learnability can be Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: The Thirty Sixth Annual Conference on Learning Theory, COLT 2023, 12-15 July 2023, Bangalore, India., pp. 5813-5849, 2023, PMLR. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
18 | Alessandro Artale, Anton R. Gnatenko, Vladislav Ryzhikov, Michael Zakharyaschev |
A Decidable Temporal DL-Lite Logic with Undecidable First-Order and Datalog-rewritability of Ontology-Mediated Atomic Queries (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Description Logics ![In: Proceedings of the 36th International Workshop on Description Logics (DL 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning (KR 2023 and NMR 2023)., Rhodes, Greece, September 2-4, 2023., 2023, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
18 | Mnacho Echenim, Radu Iosif, Nicolas Peltier |
Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 173, pp. 106169, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Zlatan Damnjanovic |
Mutual Interpretability of Weak Essentially Undecidable Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 87(4), pp. 1374-1395, December 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Nikolaos Galatos, Gavin St. John |
Most Simple Extensions of FLe are Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 87(3), pp. 1156-1200, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Andreas Klingler, Mirte van der Eyden, Sebastian Stengele, Tobias Reinhart, Gemma De las Cuevas |
Many bounded versions of undecidable problems are NP-hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.13532, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Pedro Filipe, Carlos Caleiro, Sérgio Marcelino |
Monadicity of Non-deterministic Logical Matrices is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NCL ![In: Proceedings of the 10th International Conference on Non-Classical Logics. Theory and Applications, NCL 2022, Łódź, Poland, 14-18 March 2022., pp. 55-67, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Maurice Margenstern |
The domino problem of the hyperbolic plane is undecidable, new proof. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.07317, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Matthieu Rosenfeld |
It is undecidable whether the growth rate of a given bilinear system is 1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.07630, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
18 | Jonathan Geller |
Baba is You is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.00127, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Lawrence C. Paulson |
Wetzel: Formalisation of an Undecidable Problem Linked to the Continuum Hypothesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.03159, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Hugo Gimbert |
Distributed Asynchronous Games With Causal Memory are Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 18(3), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Juvenal Murwanashyaka |
Weak essentially undecidable theories of concatenation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 61(7-8), pp. 939-976, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Amirfarhad Nilizadeh, Gary T. Leavens |
Be Realistic: Automated Program Repair is a Combination of Undecidable Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APR@ICSE ![In: 3rd IEEE/ACM International Workshop on Automated Program Repair, APR@ICSE 2022, Pittsburgh, PA, USA, May 19, 2022, pp. 31-32, 2022, IEEE, 978-1-4503-9285-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Fabian Mitterwallner, Aart Middeldorp |
Polynomial Termination Over ℕ Is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSCD ![In: 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022, August 2-5, 2022, Haifa, Israel., pp. 27:1-27:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-233-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Lawrence C. Paulson |
Wetzel: Formalisation of an Undecidable Problem Linked to the Continuum Hypothesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CICM ![In: Intelligent Computer Mathematics - 15th International Conference, CICM 2022, Tbilisi, Georgia, September 19-23, 2022, Proceedings, pp. 92-106, 2022, Springer, 978-3-031-16680-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Stepan L. Kuznetsov |
Action Logic is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 22(2), pp. 10:1-10:26, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Hugo Gimbert |
Distributed Asynchronous Games With Causal Memory are Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.14768, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
18 | Martin Kolár |
On formally undecidable propositions in nondeterministic languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.14807, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
18 | Honghao Fu, Carl A. Miller, William Slofstra |
The membership problem for constant-sized quantum correlations is undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.11087, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
18 | Benedikt T. Boenninghoff, Robert M. Nickel, Dorothea Kolossa |
O2D2: Out-Of-Distribution Detector to Capture Undecidable Trials in Authorship Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.15825, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
18 | Manuel Bodirsky, Simon Knäuer, Jakub Rydval |
Amalgamation is Undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.00452, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
18 | Erik Parmann, Thomas Ågotnes |
Reasoning about strategic voting in modal logic quickly becomes undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 31(4), pp. 1055-1078, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | M. Clarence Protin |
Type inhabitation of atomic polymorphism is undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 31(2), pp. 416-425, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Tobias Fritz |
Quantum logic is undecidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 60(3-4), pp. 329-341, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 1333 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|