The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1978-1986 (19) 1987-1989 (24) 1990-1991 (18) 1992-1993 (25) 1994 (17) 1995-1996 (23) 1997-1998 (26) 1999 (28) 2000 (27) 2001 (33) 2002 (39) 2003 (22) 2004 (35) 2005 (52) 2006 (52) 2007 (62) 2008 (60) 2009 (37) 2010 (21) 2011-2012 (26) 2013 (19) 2014 (20) 2015-2016 (28) 2017-2018 (28) 2019 (22) 2020 (21) 2021 (15) 2022-2023 (36) 2024 (7)
Publication types (Num. hits)
article(300) incollection(1) inproceedings(540) phdthesis(1)
Venues (Conferences, Journals, ...)
CoRR(99) ICALP(30) STACS(28) CSL(26) Theor. Comput. Sci.(26) MFCS(23) FSTTCS(22) FOCS(21) J. ACM(20) CCC(18) CONCUR(17) STOC(17) Theory Comput. Syst.(16) Electron. Colloquium Comput. C...(15) FoSSaCS(15) LICS(14) More (+10 of total 222)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 401 occurrences of 257 keywords

Results
Found 842 publication records. Showing 842 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
86Alan Skelley A Third-Order Bounded Arithmetic Theory for PSPACE. Search on Bibsonomy CSL The full citation details ... 2004 DBLP  DOI  BibTeX  RDF quantified propositional calculus, Bounded arithmetic, PSPACE, propositional proof complexity
67Isabel Oitavem Implicit Characterizations of Pspace. Search on Bibsonomy Proof Theory in Computer Science The full citation details ... 2001 DBLP  DOI  BibTeX  RDF implicit characterizations, computational complexity, term rewriting, Pspace
58Marcus Schaefer 0001 Deciding the K-Dimension is PSPACE-Complete. Search on Bibsonomy CCC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF computational complexity, learning theory, PSPACE
58Ke Yang Integer Circuit Evaluation is PSPACE-Complete. Search on Bibsonomy CCC The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Integer Circuit, Chinese Remainder Theorem, PSPACE
56Robert A. Hearn, Erik D. Demaine The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
55Rahul Jain 0001, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous QIP = PSPACE. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF matrix multiplicative weights update method, quantum interactive proof systems, quantum computation, semidefinite programming
48Paul S. Bonsma, Luis Cereceda Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances. Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF vertex-recolouring, colour graph, superpolynomial distance, PSPACE-complete
48Alexander Shen IP = PSPACE: Simplified Proof. Search on Bibsonomy J. ACM The full citation details ... 1992 DBLP  DOI  BibTeX  RDF interactive proofs, PSPACE
47Serge Abiteboul, Gerd G. Hillebrand Space Usage in Functional Query Languages. Search on Bibsonomy ICDT The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
46Lutz Schröder, Dirk Pattinson PSPACE Bounds for Rank-1 Modal Logics. Search on Bibsonomy LICS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
46Guoqiang Pan, Moshe Y. Vardi Fixed-Parameter Hierarchies inside PSPACE. Search on Bibsonomy LICS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
46Stéphane Demri, Denis Lugiez Presburger Modal Logic Is PSPACE-Complete. Search on Bibsonomy IJCAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
46Kurt Rohloff, Stéphane Lafortune PSPACE-completeness of Modular Supervisory Control Problems*. Search on Bibsonomy Discret. Event Dyn. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF computational complexity, verification, supervisory control, modular systems
46Petr Jancar Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete. Search on Bibsonomy LICS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
46Christof Löding, Philipp Rohde Solving the Sabotage Game Is PSPACE-Hard. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
46Joachim Niehren, Martin Müller 0001, Jean-Marc Talbot Entailment of Atomic Set Constraints is PSPACE-Complete. Search on Bibsonomy LICS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
46Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups. Search on Bibsonomy ICALP The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
46Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract). Search on Bibsonomy ICALP The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
40Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram The size-change principle for program termination. Search on Bibsonomy POPL The full citation details ... 2001 DBLP  DOI  BibTeX  RDF omega automaton, program analysis, termination, partial evaluation, PSPACE-completeness
40Wolfgang Slany The Complexity of Graph Ramsey Games. Search on Bibsonomy Computers and Games The full citation details ... 2000 DBLP  DOI  BibTeX  RDF combinatorial games, graph Ramsey theory, Ramsey game, winning strategy, achievement game, avoidance game, the game of Sim, endgames, complexity, Java applet, edge coloring, PSPACE-completeness
39Adi Shamir IP = PSPACE. Search on Bibsonomy J. ACM The full citation details ... 1992 DBLP  DOI  BibTeX  RDF IP, interactive proofs, PSPACE
39Adi Shamir IP=PSPACE Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF acceptance probability, honest provers, public coins, logarithmic workspace, two-way access, random tape, interaction, IP, randomization, polynomial time, one-way functions, zero-knowledge proofs, interactive proofs, PSPACE, polynomial space, proof verification
39James Renegar A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals Search on Bibsonomy FOCS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF real polynomials, PSPACE algorithm, existential theory, atomic predicates, Boolean function, set, decision problem
39Andrzej Lingas A PSPACE Complete Problem Related to a Pebble Game. Search on Bibsonomy ICALP The full citation details ... 1978 DBLP  DOI  BibTeX  RDF dag, completeness in polynomial space, computational complexity, PSPACE, pebble game, AND/OR graph
38Peter Niebert, Doron A. Peled Efficient Model Checking for LTL with Partial Order Snapshots. Search on Bibsonomy TACAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Thomas Eiter, Georg Gottlob On the Complexity of Theory Curbing. Search on Bibsonomy LPAR The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
38Richard Mayr On the Complexity of Bisimulation Problems for Pushdown Automata. Search on Bibsonomy IFIP TCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF verification, complexity, bisimulation, Pushdown automata
38Madhav V. Marathe, Venkatesh Radhakrishnan, Harry B. Hunt III, S. S. Ravi Hierarchical Specified Unit Disk Graphs (Extended Abstract). Search on Bibsonomy WG The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
38Ronald V. Book, Jack H. Lutz, Klaus W. Wagner On Complexity Classes and Algorithmically Random Languages (Extended Abstract). Search on Bibsonomy STACS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
37Lutz Schröder, Dirk Pattinson PSPACE bounds for rank-1 modal logics. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Shallow models, resolution, coalgebra
37Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca A logical account of pspace. Search on Bibsonomy POPL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF type assignment, linear logic, implicit computational complexity, polynomial space
37Kai Engelhardt, Peter Gammie, Ron van der Meyden Model Checking Knowledge and Linear Time: PSPACE Cases. Search on Bibsonomy LFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
37Petr Sosík, Alfonso Rodríguez-Patón P Systems with Active Membranes Characterize PSPACE. Search on Bibsonomy DNA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
37Carsten Lutz, Dirk Walther 0002, Frank Wolter Quantitative Temporal Logics: PSPACE and Below. Search on Bibsonomy TIME The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Alan Skelley Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Jirí Srba Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard. Search on Bibsonomy STACS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
37Marcel Crâsmaru, John Tromp Ladders Are PSPACE-Complete. Search on Bibsonomy Computers and Games The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
30T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan The Guarding Problem - Complexity and Approximation. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF QBF (Quantified Boolean Formula), QSAT (Quantified Satisfiability), Approximation Algorithms, PSPACE-complete
30André Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller TOPSU - RDM a simulation platform for online railway delay management. Search on Bibsonomy SimuTools The full citation details ... 2008 DBLP  DOI  BibTeX  RDF online railway delay management, simulation, heuristics, transportation, stochastic scheduling, PSPACE, experimental algorithms, online optimization, web-based simulation
30Helmut Alt, Christian Knauer, Günter Rote, Sue Whitesides The complexity of (un)folding. Search on Bibsonomy SCG The full citation details ... 2003 DBLP  DOI  BibTeX  RDF linkage reconfiguration, computational geometry, PSPACE-completeness
30Mihhail 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
30Costas Courcoubetis, Mihalis Yannakakis The Complexity of Probabilistic Verification. Search on Bibsonomy J. ACM The full citation details ... 1995 DBLP  DOI  BibTeX  RDF EXPTIME-complete, model checking, temporal logic, Markov chain, automata, probabilistic algorithm, PSPACE-complete
30Deepak Kapur, Paliath Narendran, Hantao Zhang 0001 Complexity of Sufficient-Completeness. Search on Bibsonomy FSTTCS The full citation details ... 1986 DBLP  DOI  BibTeX  RDF normal forms, term rewriting systems, PSPACE, Sufficient-completeness
30Marco A. Casanova, Ronald Fagin, Christos H. Papadimitriou Inclusion Dependencies and Their Interaction with Functional Dependencies. Search on Bibsonomy PODS The full citation details ... 1982 DBLP  DOI  BibTeX  RDF relational database, functional dependency, PSPACE-complete, inclusion dependency, complete axiomatization
28Robert S. R. Myers, Dirk Pattinson, Lutz Schröder Coalgebraic Hybrid Logic. Search on Bibsonomy FoSSaCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
28Stéphane Demri, Alexander Rabinovich The Complexity of Temporal Logic with Until and Since over Ordinals. Search on Bibsonomy LPAR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
28Laura Bozzelli, Salvatore La Torre Decision Problems for Lower/Upper Bound Parametric Timed Automata. Search on Bibsonomy ICALP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
28Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. Search on Bibsonomy ICALP (1) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Tomasz Jurdzinski On Complexity of Grammars Related to the Safety Problem. Search on Bibsonomy ICALP (2) The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
28Paul Hunter, Anuj Dawar Complexity Bounds for Regular Games. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Kousha Etessami, Mihalis Yannakakis Algorithmic Verification of Recursive Probabilistic State Machines. Search on Bibsonomy TACAS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Stéphane Demri LTL over Integer Periodicity Constraints: (Extended Abstract). Search on Bibsonomy FoSSaCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
28Marcin Rychlik On Probabilistic Quantified Satisfability Games. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
28Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao 0002, Thomas A. Henzinger, Jens Palsberg Stack Size Analysis for Interrupt-Driven Programs. Search on Bibsonomy SAS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
28Erez Petrank, Gábor Tardos On the Knowledge Complexity of NP. Search on Bibsonomy Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 68Q15, 68Q17
28Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe 0001 Games with a Uniqueness Property. Search on Bibsonomy STACS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
28Edith Hemaspaandra The Complexity of Poor Man's Logic. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
28Hing Leung On Finite Automata with Limited Nondeterminism. Search on Bibsonomy Acta Informatica The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
28Ronald V. Book, Heribert Vollmer, Klaus W. Wagner On Type-2 Probabilistic Quantifiers. Search on Bibsonomy ICALP The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
28David Lichtenstein, Michael Sipser GO Is Polynomial-Space Hard. Search on Bibsonomy J. ACM The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
27Philipp Hertel, Toniann Pitassi Exponential Time/Space Speedups for Resolution and the PSPACE-completeness of Black-White Pebbling. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Felix G. König, Marco E. Lübbecke, Rolf H. Möhring, Guido Schäfer, Ines Spenke Solutions to Real-World Instances of PSPACE-Complete Stacking. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Kyle W. Burke, Shang-Hua Teng A PSPACE-complete Sperner Triangle Game. Search on Bibsonomy WINE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Alexander Hertel, Alasdair Urquhart Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. Search on Bibsonomy CSL The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Krishnendu Chatterjee Stochastic Müller Games are PSPACE-Complete. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Scott Aaronson QMA/qpoly \subseteq PSPACE/poly: De-Merlinizing Quantum Protocols. Search on Bibsonomy CCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
27Wojciech Plandowski Satisfiability of word equations with constants is in PSPACE. Search on Bibsonomy J. ACM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF String unification, word equations
27David Richerby Logical Characterizations of PSPACE. Search on Bibsonomy CSL The full citation details ... 2004 DBLP  DOI  BibTeX  RDF choice operators, partial fixed points, descriptive complexity, Finite model theory
27Jirí Srba Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
27Dimitris Fotakis 0001, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies. Search on Bibsonomy WG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
27Volker Diekert, Claudio Gutierrez 0001, Christian Hagenah The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. Search on Bibsonomy STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF free group, Formal languages, regular language, equations
27Keijo Heljanko Model Checking with Finite Complete Prefixes Is PSPACE-Complete. Search on Bibsonomy CONCUR The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
27Wojciech Plandowski Satisfiability of Word Equations with Constants is in PSPACE. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF word equations
27John Watrous PSPACE Has Constant-Round Quantum Interactive Proof Systems. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF quantum computation, interactive proof systems
27Stephan Tobies A PSpace Algorithm for Graded Modal Logic. Search on Bibsonomy CADE The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
27Stefan Dziembowski Bounded-Variable Fixpoint Queries are PSPACE-complete. Search on Bibsonomy CSL The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
27A. A. Aaby, K. T. Narayana Propositional Temporal Interval Logic is PSPACE Complete. Search on Bibsonomy CADE The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
21Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender Complexity of finite-horizon Markov decision process problems. Search on Bibsonomy J. ACM The full citation details ... 2000 DBLP  DOI  BibTeX  RDF NPPP, computational complexity, Markov decision processes, NP, PL, partially observable Markov decision processes, PSPACE, succinct representations
21Monika Maidl The Common Fragment of CTL and LTL. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF action-based computation tree logic, linear time logic, common fragment, ACTL formulas, PSPACE-complete problem, path quantifiers, 1-weak Buchi automaton, automaton size, formula size, computational complexity, temporal logic, trees (mathematics), decidability, finite automata, expressive power, negation, CTL, LTL, inductive definition
21Rajeev Alur, Thomas A. Henzinger Back to the Future: Towards a Theory of Timed Regular Languages Search on Bibsonomy FOCS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF theory of timed regular languages, two-way timed automata, temporal logic, undecidability, boolean operations, PSPACE-complete
21Patrick Lincoln, John C. Mitchell, Andre Scedrov, Natarajan Shankar Decision Problems for Propositional Linear Logic Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF noncommutative propositional linear logic, propositional linear logic, multiplicative fragment, unrestricted weakening, NP-completeness, undecidability, decision problem, PSPACE-complete
21John H. Reif, J. D. Tygar, Akitoshi Yoshida The Computability and Complexity of Optical Beam Tracing Search on Bibsonomy FOCS The full citation details ... 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
21Xiaotie Deng, Christos H. Papadimitriou Exploring an Unknown Graph (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF unknown graph exploration, strongly connected graph, Eulerian graphs, bounded ratio, directed graph, PSPACE-complete, worst-case ratio
21Jin-yi Cai Lower Bounds for Constant Depth Circuits in the Presence of Help Bits Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF help bit, arbitrary Boolean function, exponential lower bound, parity functions, random oracle separation, constant depth circuits, constant depth circuit, PSPACE, PH
21Costas Courcoubetis, Mihalis Yannakakis Verifying Temporal Properties of Finite-State Probabilistic Programs Search on Bibsonomy FOCS The full citation details ... 1988 DBLP  DOI  BibTeX  RDF finite-state probabilistic programs, concurrent programs, linear temporal logic, temporal properties, sequential programs, PSPACE, omega -automata
19Akitoshi Kawamura, Stephen A. Cook Complexity theory for operators in analysis. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF higher-type complexity, second-order polynomials, computational complexity, computable analysis
19Kousha Etessami, Mihalis Yannakakis Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Recursive Markov chains, monotone nonlinear systems, multi-type branching processes, Newton's method, stochastic context-free grammars
19Vahab S. Mirrokni, Alexander Skopalik On the complexity of nash dynamics and sink equilibria. Search on Bibsonomy EC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF potential games, sink equilibria, nash equilibria
19Panagiotis Manolios, Aaron Turon All-Termination(T). Search on Bibsonomy TACAS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
19Yael Tauman Kalai, Ran Raz Probabilistically Checkable Arguments. Search on Bibsonomy CRYPTO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
19Aduri Pavan, N. V. Vinodchandran 2-Local Random Reductions to 3-Valued Functions. Search on Bibsonomy Comput. Complex. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF 68Q17, Subject classification. 68Q15
19Amir M. Ben-Amram Size-change termination with difference constraints. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF size-change graph, size-change termination, Abstraction, program analysis, termination analysis
19Somesh Jha, Ninghui Li, Mahesh V. Tripunitara, Qihua Wang, William H. Winsborough Towards Formal Verification of Role-Based Access Control Policies. Search on Bibsonomy IEEE Trans. Dependable Secur. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Alex Fabrikant, Christos H. Papadimitriou The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
19Lutz Schröder, Dirk Pattinson Shallow Models for Non-iterative Modal Logics. Search on Bibsonomy KI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Krishnendu Chatterjee, Koushik Sen, Thomas A. Henzinger Model-Checking omega-Regular Properties of Interval Markov Chains. Search on Bibsonomy FoSSaCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Adam Antonik, Michael Huth 0001, Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasowski Complexity of Decision Problems for Mixed and Modal Specifications. Search on Bibsonomy FoSSaCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Alexander Rabinovich Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities. Search on Bibsonomy FORMATS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
19Daniel Meister 0001 Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
19Christel Baier, Tomás Brázdil, Marcus Größer, Antonín Kucera 0001 Stochastic Game Logic. Search on Bibsonomy QEST The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 842 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][>>]
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