Space-bounded probabilistic game automata
Journal of the ACM (JACM)
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximate solutions to problems in PSPACE
ACM SIGACT News
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Combinatorial optimization games
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Contingent planning under uncertainty via stochastic satisfiability
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Initial experiments in stochastic satisfiability
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Exploiting structure in quantified formulas
Journal of Algorithms
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete
Theoretical Computer Science
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The Complexity of Graph Ramsey Games
CG '00 Revised Papers from the Second International Conference on Computers and Games
The General Notion of a Dot-Operator
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
Contingent planning under uncertainty via stochastic satisfiability
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On the stochastic constraint satisfaction framework
Proceedings of the 2007 ACM symposium on Applied computing
APPSSAT: Approximate probabilistic planning using stochastic satisfiability
International Journal of Approximate Reasoning
International Journal of Robotics Research
A Method for Evaluation of Compromise in Multiple Criteria Problems
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Robust FPGA resynthesis based on fault-tolerant Boolean matching
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
Discrete Event Dynamic Systems
From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future
Algorithmics of Large and Complex Networks
DC-SSAT: a divide-and-conquer approach to solving stochastic satisfiability problems efficiently
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Universal voting protocol tweaks to make manipulation hard
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Definition and complexity of some basic metareasoning problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Computation of equilibriain noncooperative games
Computers & Mathematics with Applications
Tetris is hard, even to approximate
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Stochastic satisfiability modulo theories for non-linear arithmetic
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
De groot duality and models of choice: Angels, demons and nature†
Mathematical Structures in Computer Science
Polyhedral and algorithmic properties of quantified linear programs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Resolution for stochastic Boolean satisfiability
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Satisfaction meets expectations: computing expected values of probabilistic hybrid systems with SMT
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Generalized craig interpolation for stochastic boolean satisfiability problems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
The complexity of reachability in randomized sabotage games
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
APPSSAT: approximate probabilistic planning using stochastic satisfiability
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Parallelism for perturbation management and robust plans
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Moving in a network under random failures: A complexity analysis
Science of Computer Programming
Survey: A glimpse at Christos H. Papadimitriou
Computer Science Review
Solving H-horizon, stationary Markov decision problems in time proportional to log(H)
Operations Research Letters
| Hi-index | 0.00 |