Search results for "nondeterministic"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	Michiel Ronsse, Koenraad De Bosschere, Mark Christiaens, Jacques Chassin de Kergommeaux, Dieter Kranzlmüller	Record/replay for nondeterministic program executions.	Commun. ACM	2003	DBLP DOI BibTeX RDF
21	Gregor Gramlich	Probabilistic and Nondeterministic Unary Automata.	MFCS	2003	DBLP DOI BibTeX RDF
21	Ahmed Khoumsi, Thierry Jéron, Hervé Marchand	Test Cases Generation for Nondeterministic Real-Time Systems.	FATES	2003	DBLP DOI BibTeX RDF	Conformance test cases generation, Determinizable Timed Automata (DTA), Set-Exp-Automata (SEA), Real-time systems, Test architecture
21	Robert A. Hearn, Erik D. Demaine	The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications.	ICALP	2002	DBLP DOI BibTeX RDF
21	Markus Holzer 0001, Martin Kutrib	State Complexity of Basic Operations on Nondeterministic Finite Automata.	CIAA	2002	DBLP DOI BibTeX RDF
21	Markus Holzer 0001, Martin Kutrib	Unary Language Operations and Their Nondeterministic State Complexity.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
21	Henry N. Adorna	On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
21	Fosca Giannotti, Giuseppe Manco 0001, Mirco Nanni, Dino Pedreschi	Nondeterministic, Nonmonotonic Logic Databases.	IEEE Trans. Knowl. Data Eng.	2001	DBLP DOI BibTeX RDF	databases, Logic programming, nondeterminism, negation, stable models
21	Sylvan Pinsky, Edward Zieglar	Noninterference Equations for Nondeterministic Systems.	CSFW	2001	DBLP DOI BibTeX RDF
21	José Fortes Gálvez, Jacques Farré, Miguel Ángel Pérez Aguiar	Practical Nondeterministic DR(k) Parsing on Graph-Structured Stack.	CICLing	2001	DBLP DOI BibTeX RDF
21	Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini	Converting Two-Way Nondeterministic Unary Automata into Simpler Automata.	MFCS	2001	DBLP DOI BibTeX RDF	unary languages, formal languages, finite state automata
21	Dieter Kranzlmüller, Rene Kobler, Jens Volkert	Event Manipulation for Nondeterministic Shared-Memory Programs.	HPCN	2001	DBLP DOI BibTeX RDF
21	Rim Belhassine-Cherif, Abderrazak Ghedamsi	Diagnostic Tests for Communicating Nondeterministic Finite State Machines.	ISCC	2000	DBLP DOI BibTeX RDF	diagnostic, symptom, Protocol conformance testing
21	Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán	Nondeterministic Instance Complexity and Hard-to-Prove Tautologies.	STACS	2000	DBLP DOI BibTeX RDF
21	Mikel L. Forcada, Rafael C. Carrasco	Encoding Nondeterministic Finite-State Tree Automata in Sigmoid Recursive Neural Networks.	SSPR/SPR	2000	DBLP DOI BibTeX RDF
21	Beata Konikowska, Marcin Bialasik	Reasoning with First Order Nondeterministic Specifications.	Acta Informatica	1999	DBLP DOI BibTeX RDF
21	Dieter Kranzlmüller, Jacques Chassin de Kergommeaux, Christian Schaubschläger	Correction of Monitor Intrusion for Testing Nondeterministic MPI-Programs.	Euro-Par	1999	DBLP DOI BibTeX RDF
21	Dieter Kranzlmüller, Jens Volkert	NOPE: A Nondeterministic Program Evaluator.	ACPC	1999	DBLP DOI BibTeX RDF
21	Clemens Lautemann, Nicole Schweikardt, Thomas Schwentick	A Logical Characterisation of Linear Time on Nondeterministic Turing Machines.	STACS	1999	DBLP DOI BibTeX RDF
21	Jan Holub 0001, Borivoj Melichar	Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching.	Workshop on Implementing Automata	1998	DBLP DOI BibTeX RDF
21	Fosca Giannotti, Giuseppe Manco 0001, Mirco Nanni, Dino Pedreschi	On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases.	CSL	1998	DBLP DOI BibTeX RDF
21	Gopal Gupta 0001, Enrico Pontelli	Optimization Schemas for Parallel Implementation of Nondeterministic Languages and Systems.	IPPS	1997	DBLP DOI BibTeX RDF
21	Juraj Hromkovic, Sebastian Seibert, Thomas Wilke	Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata.	STACS	1997	DBLP DOI BibTeX RDF
21	Marian Vittek	A Compiler for Nondeterministic Term Rewriting Systems.	RTA	1996	DBLP DOI BibTeX RDF
21	Man-lai Tse, Wing-hang Wong, Ho-fung Leung	Programming with Communicating Nondeterministic Logic Objects.	ISPAN	1996	DBLP DOI BibTeX RDF
21	Hiroaki Yamamoto	Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines.	ICALP	1993	DBLP DOI BibTeX RDF
21	Yuri Gurevich, Saharon Shelah	Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space	J. ACM	1990	DBLP DOI BibTeX RDF
21	Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer	A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time.	STACS	1990	DBLP DOI BibTeX RDF
21	V. Vinay, V. Chandru	The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata.	FSTTCS	1990	DBLP DOI BibTeX RDF
21	Joost N. Kok	An Iterative Metric Fully Abstract Semantics for Nondeterministic Dataflow (Extended Abstract).	MFCS	1989	DBLP DOI BibTeX RDF
21	Heinrich Hußmann	Nondeterministic Algebraic Specifications and Nonconfluent Term Rewriting.	ALP	1988	DBLP DOI BibTeX RDF
21	Erich Grädel	Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes.	CSL	1988	DBLP DOI BibTeX RDF
21	Tobias Nipkow	Are Homomorphisms Sufficient for Behavioural Implementations of Deterministic and Nondeterministic Data Types?	STACS	1987	DBLP DOI BibTeX RDF
21	Klaus-Jörn Lange	Decompositions of Nondeterministic Reductions (Extended Abstract).	ICALP	1986	DBLP DOI BibTeX RDF
21	Stéphane Kaplan	Rewriting with a Nondeterministic Choice Operator: From Algebra to Proofs.	ESOP	1986	DBLP DOI BibTeX RDF
21	Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo	Hoare's Logic for Nondeterministic Regular Programs: A Nonstandard Completeness Theorem.	ICALP	1985	DBLP DOI BibTeX RDF
21	Thomas J. Myers, A. Toni Cohen	Models and Transformations for Nondeterministic Extensions of Functional Programming.	FSTTCS	1984	DBLP DOI BibTeX RDF
21	Manfred Broy, Martin Wirsing	On the Algebraic Specification of Nondeterministic Programming Languages.	CAAP	1981	DBLP DOI BibTeX RDF
21	Jean H. Gallier	Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures.	ICALP	1978	DBLP DOI BibTeX RDF
21	Walter J. Savitch	Parallel and Nondeterministic Time Complexity Classes (Preliminary Report).	ICALP	1978	DBLP DOI BibTeX RDF
21	Michal Chytil	On Complexity of Nondeterministic Turing Machines Computations.	MFCS	1975	DBLP DOI BibTeX RDF
21	Detlef Wotschke	The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages.	GI Jahrestagung	1973	DBLP DOI BibTeX RDF
21	Timothy V. Griffiths	The Unsolvability of the Equivalence Problem for Lambda-Free Nondeterministic Generalized Machines.	J. ACM	1968	DBLP DOI BibTeX RDF
21	Seymour Ginsburg, Michael A. Harrison	One-way nondeterministic real-time list-storage languages.	J. ACM	1968	DBLP DOI BibTeX RDF
17	Hamilton Emmons, Sanatan Rai	Computational Complexity Theory.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Recognition problem, Time complexity function, Nondeterministic polynomial algorithm, Computational complexity, Combinatorial optimization, Reducibility, NP-complete problem, Efficient algorithm, Complexity theory, NP-hard problem, Polynomial algorithm, Decision problem, Exponential algorithm
17	Victor L. Selivanov, Klaus W. Wagner	Complexity of Aperiodicity for Topological Properties of Regular omega-Languages.	CiE	2008	DBLP DOI BibTeX RDF	Regular aperiodic ?-language, Wadge reducibility, aperiodic automaton, deterministic Muller automaton, nondeterministic Büchi automaton, monadic second-order formula
17	Chansu Yu, Kang G. Shin, Lubo Song	Maximizing Communication Concurrency via Link-Layer Packet Salvaging in Mobile Ad Hoc Networks.	IEEE Trans. Mob. Comput.	2007	DBLP DOI BibTeX RDF	nondeterministic algorithm, Mobile ad hoc networks, medium access control, carrier sense, capture effect
17	Margareta Ackerman, Jeffrey O. Shallit	Efficient Enumeration of Regular Languages.	CIAA	2007	DBLP DOI BibTeX RDF	nondeterministic finite automaton, radix order, enumeration, regular language, lexicographical order
17	Abhishek Mitra, Walid A. Najjar, Laxmi N. Bhuyan	Compiling PCRE to FPGA for accelerating SNORT IDS.	ANCS	2007	DBLP DOI BibTeX RDF	deep payload inspection, nondeterministic nite automata, intrusion detection system, regular expressions
17	Jianer Chen, Donald K. Friesen, Weijia Jia 0001, Iyad A. Kanj	Using Nondeterminism to Design Efficient Deterministic Algorithms.	Algorithmica	2004	DBLP DOI BibTeX RDF	Three-dimensional matching, Nondeterministic algorithms, Parameterized algorithms
17	Toshikazu Wada, Takashi Matsuyama	Multiobject Behavior Recognition by Event Driven Selective Attention Method.	IEEE Trans. Pattern Anal. Mach. Intell.	2000	DBLP DOI BibTeX RDF	selective attention mechanism, toke propagation, multiviewpoint image, HMM, Behavior recognition, nondeterministic finite automata
17	Mohammed Almulla, Tadeusz Szuba	Toward a Computational Model of Collective Intelligence and its IQ Measure.	SAC	1999	DBLP DOI BibTeX RDF	IQ measure, nondeterministic model of computations, quasi-chaotic Brownian movements, PROLOG, collective intelligence, social structure
17	Alan R. Woods	Unsatisfiable Systems of Equations, Over a Finite Field.	FOCS	1998	DBLP DOI BibTeX RDF	nondeterministic computation, random polynomials, finite field, proofs, quadratic equations
17	C. Rominger, Jean Claude Geffroy	Hazard analysis of structured sequential systems.	Annual Simulation Symposium	1995	DBLP DOI BibTeX RDF	structured sequential systems, time uncertainties, asynchronous sequential systems, nondeterministic phenomena, simulation method, structured systems, fault diagnosis, CAD, logic testing, timing, sequential circuits, logic CAD, asynchronous circuits, digital simulation, time analysis, circuit analysis computing, hazard analysis, asynchronous sequential logic
17	Timothy Kam, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli	Implicit state minimization of non-deterministic FSMs.	ICCD	1995	DBLP DOI BibTeX RDF	implicit state minimization, nondeterministic finite state machines, fully implicit algorithm, finite state machines, logic design, minimisation
17	Alexandre E. Eichenberger, Santosh G. Abraham	Modeling load imbalance and fuzzy barriers for scalable shared-memory multiprocessors.	HICSS (1)	1995	DBLP DOI BibTeX RDF	fuzzy barriers, overall execution time, parallel region, nondeterministic load imbalance modelling, random replacement policy, processor caches, cyclic access stream, interprocessor synchronization, 64-processor KSR system, Kendall Square Research system, random first-level caches, performance evaluation, resource allocation, concurrency control, synchronisation, shared memory systems, cache storage, variance, performance improvement, network contention, hit ratio, scalable shared-memory multiprocessors
17	Jens Knoop, Oliver Rüthing, Bernhard Steffen	Optimal Code Motion: Theory and Practice.	ACM Trans. Program. Lang. Syst.	1994	DBLP DOI BibTeX RDF	t-refined flow graphs, critical edges, elimination of partial redundancies, lifetimes of registers, nondeterministic flowgraphs, data flow analysis, code motion, lifetime optimality, computational optimality
17	Ran Raz, Boris Spieker	On the "log rank"-Conjecture in Communication Complexity	FOCS	1993	DBLP DOI BibTeX RDF	information theoretic argument, non-constant gap, log rank, input matrix, nondeterministic, superpolynomial gap, group representations, communication complexity, Hamiltonian cycle, chromatic number
17	Kostas N. Oikonomou	Abstractions of Finite-State Machines and Immediately-Detectable Output Faults.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	immediately-detectable output faults, nondeterministic machine, approximately optimal partition, computational complexity, data structures, fault tolerant computing, abstraction, NP-complete, finite-state machines, polynomial-time algorithm, finite automata, set partitioning
17	Toniann Pitassi, Alasdair Urquhart	The Complexity of the Hajós Calculus	FOCS	1992	DBLP DOI BibTeX RDF	Hajos calculus, nondeterministic procedure, polynomially-bounded, Frege proof systems, complexity, graph theory
17	László Babai, Lance Fortnow, Carsten Lund	Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols	FOCS	1990	DBLP DOI BibTeX RDF	efficient provability, multiple prover interactive proof systems, two-prover interactive protocols, noncommunicating provers, randomizing polynomial-time verifier, coNP-complete languages, nondeterministic exponential time, polynomial time
17	Peter D. Hortensius, Howard C. Card, Robert D. McLeod, Werner Pries	Importance Sampling for Ising Computers Using One-Dimensional Cellular Automata.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	Ising computers, Ising configurations, CA architecture, nondeterministic algorithms, parallel algorithms, parallel architectures, cellular automata, finite automata, Monte Carlo methods, Monte Carlo simulation, importance sampling, VLSI architectures, random-number generation, random number generation, Ising model
17	Ian Parberry	A Note on Nondeterminism in Small, Fast Parallel Computers.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	nondeterministic analogues, fast parallel computers, language classes, SC, NNC, NSC, deterministic Turing machine, polylog tape-head reversals, POLYLOGSPACE, simultaneous polynomial time, read-only input tape, read-write work tape, computational complexity, parallel computation, parallel machines, formal languages, nondeterminism, Turing machines, subset, NC
17	Wen-Guey Tzeng	The Equivalence and Learning of Probabilistic Automata (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	learning protocol, coNP, learning, polynomial-time algorithm, upper bound, equivalence, covering, probabilistic automata, nondeterministic finite automata
17	Danny Dolev, Tomás Feder	Multiparty Communication Complexity	FOCS	1989	DBLP DOI BibTeX RDF	nondeterministic communication complexity, information lower bound, Boolean function, communication complexity
17	William E. Weihl	Commutativity-Based Concurrency Control for Abstract Data Types.	IEEE Trans. Computers	1988	DBLP DOI BibTeX RDF	local atomicity property, dynamic atomicity, nondeterministic, recovery methods, intentions lists, undo logs, parallel processing, concurrency control, abstract data types, serializability, commutativity, concurrency algorithms, partial
17	Chao-Chih Yang, Charmane P. May	A Correction and Some Comments Concerning Graph Isomorphism by Finite Automata.	IEEE Trans. Computers	1978	DBLP DOI BibTeX RDF	nondeterministic state machine, Automatum, deterministic state machine, Moore sequential machine, directed graph, isomorphism
17	Erik Sandewall	Conversion of Predicate-Calculus Axioms to Corresponding Deterministic Programs.	IEEE Trans. Computers	1976	DBLP DOI BibTeX RDF	FUNARG-expression, nondeterministic, theorem proving, retrieval, Closure, deduction
17	Tiu Le Van, Noël van Houtte	Delayed Universal Logic Modules and Sequential Machine Synthesis.	IEEE Trans. Computers	1975	DBLP DOI BibTeX RDF	Accepted sequence, component machine, delayed universal logic module, distributed logic, inverse binary tree, nondeterministic automaton, reversed machine, simple synthesis, transition map, 2n-in-1 multiplexer, universal logic module, decomposition, sequential machine
17	Walter L. Johnson, James H. Porter, Stephanie I. Ackley, Douglas T. Ross	Automatic generation of efficient lexical processors using finite state techniques.	Commun. ACM	1968	DBLP DOI BibTeX RDF	lexical processor, nondeterministic machine, plex structure, syntatic analysis, compiler, finite-state machine, parsing, regular expressions, finite-state automata, sequential machine, character string
14	Jacob Burnim, Koushik Sen	DETERMIN: inferring likely deterministic specifications of multithreaded programs.	ICSE (1)	2010	DBLP DOI BibTeX RDF	parallel programs, determinism, specification inference
14	Charles E. Leiserson, Tao B. Schardl	A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers).	SPAA	2010	DBLP DOI BibTeX RDF	hyperobjects, parallel algorithms, multithreading, graph algorithms, reducers, nondeterminism, work-stealing, breadth-first search, cilk
14	Derek Hower, Pablo Montesinos, Luis Ceze, Mark D. Hill, Josep Torrellas	Two hardware-based approaches for deterministic multiprocessor replay.	Commun. ACM	2009	DBLP DOI BibTeX RDF
14	Robert L. Bocchino Jr., Vikram S. Adve, Danny Dig, Sarita V. Adve, Stephen Heumann, Rakesh Komuravelli, Jeffrey Overbey, Patrick Simmons, Hyojin Sung, Mohsen Vakilian	A type and effect system for deterministic parallel Java.	OOPSLA	2009	DBLP DOI BibTeX RDF	deterministic parallelism, determinism, effects, commutativity, effect systems
14	Udi Boker, Orna Kupferman	Co-ing Büchi Made Tight and Useful.	LICS	2009	DBLP DOI BibTeX RDF
14	Christian Dax, Felix Klaedtke, Martin Lange	On Regular Temporal Logics with Past, .	ICALP (2)	2009	DBLP DOI BibTeX RDF
14	Colin Stirling	Dependency Tree Automata.	FoSSaCS	2009	DBLP DOI BibTeX RDF	binding terms, Tree automata, typed lambda calculus
14	Markus Lohrey, Sebastian Maneth, Manfred Schmidt-Schauß	Parameter Reduction in Grammar-Compressed Trees.	FoSSaCS	2009	DBLP DOI BibTeX RDF
14	Jean Vuillemin, Nicolas Gama	Compact Normal Form for Regular Languages as Xor Automata.	CIAA	2009	DBLP DOI BibTeX RDF
14	Galina Jirásková	Magic Numbers and Ternary Alphabet.	Developments in Language Theory	2009	DBLP DOI BibTeX RDF
14	Krishnendu Chatterjee, Laurent Doyen 0001, Thomas A. Henzinger	Alternating Weighted Automata.	FCT	2009	DBLP DOI BibTeX RDF
14	Sergio Giro	Undecidability Results for Distributed Probabilistic Systems.	SBMF	2009	DBLP DOI BibTeX RDF
14	Krishnendu Chatterjee, Laurent Doyen 0001, Thomas A. Henzinger	Probabilistic Weighted Automata.	CONCUR	2009	DBLP DOI BibTeX RDF
14	Christel Baier, Nathalie Bertrand 0001, Marcus Größer	The Effect of Tossing Coins in Omega-Automata.	CONCUR	2009	DBLP DOI BibTeX RDF
14	Sergey Goncharov 0001, Lutz Schröder, Till Mossakowski	Kleene Monads: Handling Iteration in a Framework of Generic Effects.	CALCO	2009	DBLP DOI BibTeX RDF
14	Rotem Oshman	An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking.	VMCAI	2009	DBLP DOI BibTeX RDF
14	Oscar H. Ibarra, Ömer Egecioglu	Hierarchies and Characterizations of Stateless Multicounter Machines.	COCOON	2009	DBLP DOI BibTeX RDF	Stateless multicounter machine, reversal-bounded, non- realtime, stateless multihead automata, hierarchy, closure properties, semilinear set
14	Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen	Schema-conscious filtering of XML documents.	EDBT	2009	DBLP DOI BibTeX RDF
14	Yongming Li 0001	Approximation and universality of fuzzy Turing machines.	Sci. China Ser. F Inf. Sci.	2008	DBLP DOI BibTeX RDF	fuzzy Turing machine, fuzzy recursively enumerable language, fuzzy recursive language, universal fuzzy Turing machine, fuzzy algorithm
14	Valentino Crespi, George Cybenko, Guofei Jiang	The theory of trackability with applications to sensor networks.	ACM Trans. Sens. Networks	2008	DBLP DOI BibTeX RDF	multiple hypotheses, Sensor networks, tracking
14	Rupert Hölzl 0001, Wolfgang Merkle	Generation Complexity Versus Distinction Complexity.	TAMC	2008	DBLP DOI BibTeX RDF
14	Mehdi Mhalla, Simon Perdrix	Finding Optimal Flows Efficiently.	ICALP (1)	2008	DBLP DOI BibTeX RDF
14	Franco Turini	The Semantics of Ugo Montanari.	Concurrency, Graphs and Models	2008	DBLP DOI BibTeX RDF
14	Stéphane Demri, Ranko Lazic 0001, Arnaud Sangnier	Model Checking Freeze LTL over One-Counter Automata.	FoSSaCS	2008	DBLP DOI BibTeX RDF
14	Victor L. Selivanov, Klaus W. Wagner	Complexity of Topological Properties of Regular omega-Languages.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF
14	Henning Bordihn, Martin Kutrib, Andreas Malcher	On the Computational Capacity of Parallel Communicating Finite Automata.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF
14	Jicheng Fu, Farokh B. Bastani, Vincent Ng 0001, I-Ling Yen, Yansheng Zhang	FIP: A Fast Planning-Graph-Based Iterative Planner.	ICTAI (1)	2008	DBLP DOI BibTeX RDF
14	Gianluigi Zavattaro, Luca Cardelli	Termination Problems in Chemical Kinetics.	CONCUR	2008	DBLP DOI BibTeX RDF
14	Rachid Guerraoui, Thomas A. Henzinger, Vasu Singh	Completeness and Nondeterminism in Model Checking Transactional Memories.	CONCUR	2008	DBLP DOI BibTeX RDF
14	Andreas Morgenstern, Klaus Schneider 0001	From LTL to Symbolically Represented Deterministic Automata.	VMCAI	2008	DBLP DOI BibTeX RDF