Search results for "nondeterministic"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
14	Kristoffer Arnsfelt Hansen	Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size.	CCC	2008	DBLP DOI BibTeX RDF	Constant Width, Circuits, Planarity, Branching Programs
14	Yonatan Aumann, Yair Dombb	Fixed Structure Complexity.	IWPEC	2008	DBLP DOI BibTeX RDF
14	Feng Qin, Joseph A. Tucek, Yuanyuan Zhou 0001, Jagadeesan Sundaresan	Rx: Treating bugs as allergies - a safe method to survive software failures.	ACM Trans. Comput. Syst.	2007	DBLP DOI BibTeX RDF	Reliability, Availability, Bug, Software Failure
14	Ladislav Vagner, Borivoj Melichar	Parallel LL parsing.	Acta Informatica	2007	DBLP DOI BibTeX RDF
14	Alessandro Ferrante, Aniello Murano, Mimmo Parente	Enriched µ-Calculus Pushdown Module Checking.	LPAR	2007	DBLP DOI BibTeX RDF
14	Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nancy A. Lynch, Olivier Pereira	Compositional Security for Task-PIOAs.	CSF	2007	DBLP DOI BibTeX RDF
14	Martin Kutrib, Andreas Malcher, Larissa Werlein	Regulated Nondeterminism in Pushdown Automata.	CIAA	2007	DBLP DOI BibTeX RDF	regulated nondeterminism, limited nondeterminism, pushdown automata, closure properties
14	Alberto Bertoni, Massimiliano Goldwurm, Violetta Lonati	On the Complexity of Unary Tiling-Recognizable Picture Languages.	STACS	2007	DBLP DOI BibTeX RDF	unary picture languages, tiling systems, Turing machine head reversal
14	Joseph G. Slember, Priya Narasimhan	Handling Emergent Nondeterminism in Replicated Services.	WADS	2007	DBLP DOI BibTeX RDF
14	Sumit Gulwani, Ashish Tiwari 0001	Assertion Checking Unified.	VMCAI	2007	DBLP DOI BibTeX RDF
14	Alberto Leporati, Claudio Zandron, Claudio Ferretti, Giancarlo Mauri	Solving Numerical NP-Complete Problems with Spiking Neural P Systems.	Workshop on Membrane Computing	2007	DBLP DOI BibTeX RDF
14	Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay	Circuits on cylinders.	Comput. Complex.	2006	DBLP DOI BibTeX RDF	Subject classification. 68Q05, 68Q70
14	Orna Kupferman, Nir Piterman, Moshe Y. Vardi	Safraless Compositional Synthesis.	CAV	2006	DBLP DOI BibTeX RDF
14	Martin De Wulf, Laurent Doyen 0001, Thomas A. Henzinger, Jean-François Raskin	Antichains: A New Algorithm for Checking Universality of Finite Automata.	CAV	2006	DBLP DOI BibTeX RDF
14	Marcelo d'Amorim, Ahmed Sobeih, Darko Marinov	Optimized Execution of Deterministic Blocks in Java PathFinder.	ICFEM	2006	DBLP DOI BibTeX RDF
14	Mikolaj Bojanczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin	Expressive Power of Pebble Automata.	ICALP (1)	2006	DBLP DOI BibTeX RDF
14	Qiqi Yan	Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique.	ICALP (2)	2006	DBLP DOI BibTeX RDF
14	Sven Schewe	Synthesis for Probabilistic Environments.	ATVA	2006	DBLP DOI BibTeX RDF
14	Roderick Bloem, Alessandro Cimatti, Ingo Pill, Marco Roveri, Simone Semprini	Symbolic Implementation of Alternating Automata.	CIAA	2006	DBLP DOI BibTeX RDF
14	Cong Liu 0013, Alex Kondratyev, Yosinori Watanabe, Alberto L. Sangiovanni-Vincentelli, Jörg Desel	Schedulability Analysis of Petri Nets Based on Structural Properties.	ACSD	2006	DBLP DOI BibTeX RDF
14	Orna Kupferman, Sarai Sheinvald-Faragy	Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words.	CONCUR	2006	DBLP DOI BibTeX RDF
14	Daniela Alvim Seabra de Oliveira, Jedidiah R. Crandall, Gary Wassermann, Shyhtsun Felix Wu, Zhendong Su 0001, Frederic T. Chong	ExecRecorder: VM-based full-system replay for attack analysis and system recovery.	ASID	2006	DBLP DOI BibTeX RDF	virtual machines, recovery, malware, worms, replay, invasive software
14	Lance Fortnow, Richard J. Lipton, Dieter van Melkebeek, Anastasios Viglas	Time-space lower bounds for satisfiability.	J. ACM	2005	DBLP DOI BibTeX RDF	Complexity of satisfiability, time-space lower bounds
14	Richard Bruce, Michael Hoffmann 0002, Danny Krizanc, Rajeev Raman	Efficient Update Strategies for Geometric Computing with Uncertainty.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
14	Richard Edwin Stearns, Harry B. Hunt III	Resource Bounds and Subproblem Independence.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
14	Alexander Brodsky 0001, Hadon Nash	CoJava: a unified language for simulation and optimization.	OOPSLA Companion	2005	DBLP DOI BibTeX RDF	simulation, optimization, constraints
14	Raymond E. Miller, Dongluo Chen, David Lee, Ruibing Hao	Coping with Nondeterminism in Network Protocol Testing.	TestCom	2005	DBLP DOI BibTeX RDF
14	Yuxin Deng, Catuscia Palamidessi	Axiomatizations for Probabilistic Finite-State Behaviors.	FoSSaCS	2005	DBLP DOI BibTeX RDF
14	Bernd Braßel, Michael Hanus	Nondeterminism Analysis of Functional Logic Programs.	ICLP	2005	DBLP DOI BibTeX RDF
14	Oscar H. Ibarra, Hsu-Chun Yen	On Deterministic Catalytic Systems.	CIAA	2005	DBLP DOI BibTeX RDF
14	Ehud Friedgut, Orna Kupferman, Moshe Y. Vardi	Büchi Complementation Made Tighter.	ATVA	2004	DBLP DOI BibTeX RDF
14	Troy Lee, Andrei E. Romashchenko	On Polynomially Time Bounded Symmetry of Information.	MFCS	2004	DBLP DOI BibTeX RDF
14	Jozef Jirásek 0001, Galina Jirásková, Alexander Szabari	State Complexity of Concatenation and Complementation of Regular Languages.	CIAA	2004	DBLP DOI BibTeX RDF
14	Henning Bordihn, Markus Holzer 0001, Martin Kutrib	Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages.	Developments in Language Theory	2004	DBLP DOI BibTeX RDF
14	Orna Kupferman, Moshe Y. Vardi	From Complementation to Certification.	TACAS	2004	DBLP DOI BibTeX RDF
14	Miguel Castro 0001, Rodrigo Rodrigues 0001, Barbara Liskov	BASE: Using abstraction to improve fault tolerance.	ACM Trans. Comput. Syst.	2003	DBLP DOI BibTeX RDF	asynchronous systems, Byzantine fault tolerance, N-version programming, state machine replication, proactive recovery
14	Markus Holzer 0001, Martin Kutrib	Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k.	ICALP	2003	DBLP DOI BibTeX RDF
14	Moshe Y. Vardi	Logic and Automata: A Match Made in Heaven.	ICALP	2003	DBLP DOI BibTeX RDF
14	Carsten Fritz	Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata.	CIAA	2003	DBLP DOI BibTeX RDF
14	Jean-Marc Champarnaud, Fabien Coulon	NFA Reduction Algorithms by Means of Regular Inequalities.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF
14	Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay	Circuits on Cylinders.	FCT	2003	DBLP DOI BibTeX RDF
14	François Coste, Daniel Fredouille	Unambiguous Automata Inference by Means of State-Merging Methods.	ECML	2003	DBLP DOI BibTeX RDF
14	Lutz Schröder, Till Mossakowski	Monad-Independent Hoare Logic in HASCASL.	FASE	2003	DBLP DOI BibTeX RDF
14	Orna Kupferman, Nir Piterman, Moshe Y. Vardi	Pushdown Specifications.	LPAR	2002	DBLP DOI BibTeX RDF
14	Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai	Computational Complexity in the Hyperbolic Plane.	MFCS	2002	DBLP DOI BibTeX RDF	complexity, cellular automata, hyperbolic geometry
14	Philipp Woelfel	On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism.	CCC	2002	DBLP DOI BibTeX RDF	Lower Bounds, BDDs, Nondeterminism, Branching Programs, Integer Multiplication
14	Gianluigi Greco, Sergio Greco, Irina Trubitsyna, Ester Zumpano	Translating Datalog-Like Optimization Queries into ILOG Programs.	LOPSTR	2002	DBLP DOI BibTeX RDF
14	Chi-Jen Lu	Derandomizing Arthur-Merlin games under uniform assumptions.	Comput. Complex.	2001	DBLP DOI BibTeX RDF	graph nonisomorphism problem, nondeterminism, Derandomization, uniformity, Arthur-Merlin games
14	Thierry Cachat	Two-Way Tree Automata Solving Pushdown Games.	Automata, Logics, and Infinite Games	2001	DBLP DOI BibTeX RDF
14	George C. Necula, Shree Prakash Rahul	Oracle-based checking of untrusted software.	POPL	2001	DBLP DOI BibTeX RDF	ORACLE
14	Borivoj Melichar, Jan Skryja	On the Size of Deterministic Finite Automata.	CIAA	2001	DBLP DOI BibTeX RDF
14	Lane A. Hemaspaandra, Harald Hempel, Arfst Nickelsen	Algebraic Properties for P-Selectivity.	COCOON	2001	DBLP DOI BibTeX RDF
14	Willem Visser, Howard Barringer	Practical CTL* Model Checking: Should SPIN be Extended?	Int. J. Softw. Tools Technol. Transf.	2000	DBLP DOI BibTeX RDF	Büchi automata, Hesitant alternating automata, Model checking, Games, Spin
14	Martin Sauerhoff	An Improved Hierarchy Result for Partitioned BDDs.	Theory Comput. Syst.	2000	DBLP DOI BibTeX RDF
14	Chi-Jen Lu	Derandomizing Arthur-Merlin Games under Uniform Assumptions.	ISAAC	2000	DBLP DOI BibTeX RDF
14	Oscar H. Ibarra	Reachability and Safety in Queue Systems.	CIAA	2000	DBLP DOI BibTeX RDF
14	Lynette van Zijl, John-Paul Harper, Frank Olivier	The MERLin Environment Applied to *-NFAs.	CIAA	2000	DBLP DOI BibTeX RDF
14	Michael W. Mislove	Models Supporting Nondeterminism and Probabilistic Choice.	IPDPS Workshops	2000	DBLP DOI BibTeX RDF
14	Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norman, David Parker 0001, Roberto Segala	Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation.	TACAS	2000	DBLP DOI BibTeX RDF
14	Mikhail Moshkov	Classification of Infinite Information Systems.	Rough Sets and Current Trends in Computing	2000	DBLP DOI BibTeX RDF
14	Thomas Buchholz, Andreas Klein 0001, Martin Kutrib	Real-Time Language Recognition by Alternating Cellular Automata.	IFIP TCS	2000	DBLP DOI BibTeX RDF
14	Johannes Köbler, Jochen Messner	Is the Standard Proof System for SAT P-Optimal?	FSTTCS	2000	DBLP DOI BibTeX RDF
14	Iannis Tourlakis	Time-Space Lower Bounds for SAT on Uniform and Non-Uniform Machines.	CCC	2000	DBLP DOI BibTeX RDF
14	Joost Engelfriet, Hendrik Jan Hoogeboom	Two-Way Finite State Transducers and Monadic Second-Order Logic.	ICALP	1999	DBLP DOI BibTeX RDF
14	Ján Manuch	Multiparty Communication Complexity: Very Hard Functions.	MFCS	1999	DBLP DOI BibTeX RDF
14	Orna Kupferman, Moshe Y. Vardi	The Weakness of Self-Complementation.	STACS	1999	DBLP DOI BibTeX RDF
14	Clemens Lautemann, Pierre McKenzie, Thomas Schwentick, Heribert Vollmer	The Descriptive Complexity Approach to LOGCFL.	STACS	1999	DBLP DOI BibTeX RDF
14	In Sang Chung, Hyeon Soo Kim, Hyun Seop Bae, Yong Rae Kwon, Byung-Sun Lee	Testing of Concurrent Programs Based on Message Sequence Charts.	PDSE	1999	DBLP DOI BibTeX RDF	Concurrent Program Testing, Constraints-based Testing, Message Sequence Charts
14	Orna Kupferman, Moshe Y. Vardi	Robust Satisfaction.	CONCUR	1999	DBLP DOI BibTeX RDF
14	Bengt Jonsson 0001, Wang Yi 0001	Fully Abstract Characterization of Probabilistic May Testing.	ARTS	1999	DBLP DOI BibTeX RDF
14	Alexander Moshe Rabinovich	Modularity and Expressibility for Nets of Relations.	Acta Informatica	1998	DBLP DOI BibTeX RDF
14	Ming-Dong Feng, Chung-Kwong Yuen	Detection of Races and Control-Flow Nondeterminism.	LCR	1998	DBLP DOI BibTeX RDF
14	Christopher Colby, Patrice Godefroid, Lalita Jategaonkar Jagadeesan	Automatically Closing Open Reactive Programs.	PLDI	1998	DBLP DOI BibTeX RDF	C
14	Jochen Meßner, Jacobo Torán	Optimal Proof Systems for Propositional Logic and Complete Sets.	STACS	1998	DBLP DOI BibTeX RDF
14	Damian Niwinski, Igor Walukiewicz	Relating Hierarchies of Word and Tree Automata.	STACS	1998	DBLP DOI BibTeX RDF
14	Attila Kondacs, John Watrous	On the Power of Quantum Finite State Automata.	FOCS	1997	DBLP DOI BibTeX RDF	quantum finite state automata, non-regular language, finite automata, finite state automata, regular languages
14	Farid M. Ablayev	Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs.	ICALP	1997	DBLP DOI BibTeX RDF
14	Bernd Kirsig	A Relation Between Sparse and Printable Sets in NSPACE(log n).	Foundations of Computer Science: Potential - Theory - Cognition	1997	DBLP DOI BibTeX RDF
14	Harry Buhrman, Lance Fortnow	Resource-Bounded Kolmogorov Complexity Revisited.	STACS	1997	DBLP DOI BibTeX RDF
14	Vikraman Arvind, Johannes Köbler	On Resource-Bounded Measure and Pseudorandomness.	FSTTCS	1997	DBLP DOI BibTeX RDF
14	Valeria Bertacco, Maurizio Damiani	Boolean Function Representation Using Parallel-Access Diagrams.	Great Lakes Symposium on VLSI	1996	DBLP DOI BibTeX RDF
14	Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini	Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular Languages.	MFCS	1995	DBLP DOI BibTeX RDF
14	Ioan I. Macarie	On the Structure of Log-Space Probabilistic Complexity Classes (Extended Abstract).	STACS	1995	DBLP DOI BibTeX RDF
14	Erich Grädel, Yuri Gurevich	Tailoring Recursing for Complexity.	ICALP	1994	DBLP DOI BibTeX RDF
14	Carsten Damm, Markus Holzer 0001	Inductive Counting Below LOGSPACE.	MFCS	1994	DBLP DOI BibTeX RDF
14	Ludwig Staiger	Recursive Automata on Infinite Words.	STACS	1993	DBLP DOI BibTeX RDF
14	Janusz A. Brzozowski, Helmut Jürgensen	A model for sequential machine testing and diagnosis.	J. Electron. Test.	1992	DBLP DOI BibTeX RDF	Markov chains, Diagnosis, fault models, random testing, sequential machines
14	Tao Jiang 0001, Bala Ravikumar	Minimal NFA Problems Are Hard.	ICALP	1991	DBLP DOI BibTeX RDF
14	Oscar H. Ibarra, Tao Jiang 0001, Hui Wang 0008	Some Results Concerning 2-D On-line Tessellation Acceptors and 2-D Alternating Finite Automata.	MFCS	1991	DBLP DOI BibTeX RDF
14	Harry Buhrman, Edith Spaan, Leen Torenvliet	Bounded Reductions.	STACS	1991	DBLP DOI BibTeX RDF
14	Marek Karpinski, Friedhelm Meyer auf der Heide	On the Complexity of Genuinely Polynomial Computation.	MFCS	1990	DBLP DOI BibTeX RDF
14	Ivana Cerná	Some Properties of Zerotesting Bounded One-Way Multicounter Machines.	MFCS	1990	DBLP DOI BibTeX RDF
14	Oscar H. Ibarra, Hui Wang 0008, Tao Jiang 0001	Efficient parallel algorithms for solving set recurrence equations and applications.	SPDP	1990	DBLP DOI BibTeX RDF
14	Yuri Gurevich, Saharon Shelah	Nearly Linear Time.	Logic at Botik	1989	DBLP DOI BibTeX RDF
14	Bengt Jonsson 0001	A Fully Abstract Trace Model for Dataflow Networks.	POPL	1989	DBLP DOI BibTeX RDF
14	Michael G. Main, David L. Black 0002	Semantic Models for Total Correctness and Fairness.	Mathematical Foundations of Programming Semantics	1989	DBLP DOI BibTeX RDF
14	Oscar H. Ibarra, Tao Jiang 0001, Hui Wang 0008	Parallel Parsing on a One-way Linear Array of Finite-State Machines.	FSTTCS	1989	DBLP DOI BibTeX RDF
14	Wim H. Hesselink	A Mathematical Approach to Nondeterminism in Data Types.	ACM Trans. Program. Lang. Syst.	1988	DBLP DOI BibTeX RDF
14	Anna Slobodová	On the Power of Communication in Alternating Machines.	MFCS	1988	DBLP DOI BibTeX RDF
14	Akira Ito, Katsushi Inoue, Itsuo Takanami	The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines.	IMYCS	1988	DBLP DOI BibTeX RDF