|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1063 occurrences of 698 keywords
|
|
|
Results
Found 2336 publication records. Showing 2336 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
78 | Beate Bollig |
Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 295-306, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
72 | Benjamin Aminof, Orna Kupferman |
On the Succinctness of Nondeterminism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 4th International Symposium, ATVA 2006, Beijing, China, October 23-26, 2006., pp. 125-140, 2006, Springer, 3-540-47237-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
71 | Beate Bollig, Philipp Woelfel |
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(6), pp. 671-685, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
71 | Beate Bollig, Philipp Woelfel |
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 131-142, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
64 | Dieter Spreen |
On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: CSL '87, 1st Workshop on Computer Science Logic, Karlsruhe, Germany, October 12-16, 1987, Proceedings, pp. 289-303, 1987, Springer, 3-540-50241-6. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
60 | Natalia Shabaldina, Khaled El-Fakih, Nina Yevtushenko 0001 |
Testing Nondeterministic Finite State Machines with Respect to the Separability Relation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TestCom/FATES ![In: Testing of Software and Communicating Systems, 19th IFIP TC6/WG6.1 International Conference, TestCom 2007, 7th International Workshop, FATES 2007, Tallinn, Estonia, June 26-29, 2007, Proceedings, pp. 305-318, 2007, Springer, 978-3-540-73065-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
separability relation, testing nondeterministic FSMs |
57 | Martin Sauerhoff |
Computing with Restricted Nondeterminism: The Dependence of the OBDD Size on the Number of Nondeterministic Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings, pp. 342-355, 1999, Springer, 3-540-66836-5. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
57 | Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes |
Using Inductive Counting to Simulate Nondeterministic Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1990, MFCS'90, Banská Bystrica, Czechoslovakia, August 27-31, 1990, Proceedings, pp. 187-194, 1990, Springer, 3-540-52953-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
53 | Michal Armoni, Noa Lewenstein, Mordechai Ben-Ari |
Teaching students to think nondeterministically. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, SIGCSE 2008, Portland, OR, USA, March 12-15, 2008, pp. 4-8, 2008, ACM, 978-1-59593-799-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
nondeterministic automata, nondeterminism |
53 | P. A. Subrahmanyam |
Nondeterminism in Abstract Data Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings, pp. 148-164, 1981, Springer, 3-540-10843-2. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
nondeterministic operations, extraction equivalence, observable behavior, implementations, correctness, abstract data types, nondeterminism |
53 | Joseph M. Morris, Malcolm Tyrrell |
Dually nondeterministic functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 30(6), pp. 34:1-34:34, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Angelic nondeterminacy, demonic nondeterminacy, free completely distributive lattice, modeling nondeterminacy, nondeterministic functions, nondeterminism |
53 | Xianan Zhang, Flavio Junqueira, Matti A. Hiltunen, Keith Marzullo, Richard D. Schlichting |
Replicating Nondeterministic Services on Grid Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPDC ![In: Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, HPDC-15, Paris, France, June 19-23, 2006, pp. 105-116, 2006, IEEE, 1-4244-0307-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
nondeterministic service, primary-backup approach, replicated grid service, Web service, distributed systems, synchronous system |
53 | Lev Nachmanson, Margus Veanes, Wolfram Schulte, Nikolai Tillmann, Wolfgang Grieskamp |
Optimal strategies for testing nondeterministic systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSTA ![In: Proceedings of the ACM/SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2004, Boston, Massachusetts, USA, July 11-14, 2004, pp. 55-64, 2004, ACM, 1-58113-820-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
optimal game strategies, probabilistic nondeterministic finite state machines, abstract state machines |
53 | Gang Luo, Gregor von Bochmann, Alexandre Petrenko |
Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized WP-Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(2), pp. 149-162, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
communicating nondeterministic finite-state machines, generalized Wp-method, conformance relation, trace-equivalence, deterministic finite-state machines, software engineering, software engineering, protocols, software testing, finite state machines, specification languages, program testing, concurrent programs, communication protocols, fault coverage, conformance testing, programming theory, SDL, reachability analysis, test suites, multiprocessing programs, test selection, protocol engineering, test sequence generation, protocol conformance testing |
53 | John G. Geske, Diane Kakihara |
Almost-Everywhere Complexity, Bi-Immunity and Nondeterministic Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCI ![In: Advances in Computing and Information - ICCI'90, International Conference on Computing and Information, Niagara Falls, Canada, May 23-26, 1990, Proceedings, pp. 44-51, 1990, Springer, 3-540-53504-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
Nondeterministic space complexity, immune sets, almost-everywhere complexity, hierarchy theorems |
50 | Yitong Yin |
Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 72-83, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
50 | Andreas Glausch, Wolfgang Reisig |
A Semantic Characterization of Unbounded-Nondeterministic Abstract State Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALCO ![In: Algebra and Coalgebra in Computer Science, Second International Conference, CALCO 2007, Bergen, Norway, August 20-24, 2007, Proceedings, pp. 242-256, 2007, Springer, 978-3-540-73857-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
50 | Chandra M. R. Kintala, Detlef Wotschke |
Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings, pp. 291-305, 1986, Springer, 3-540-16078-7. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
49 | Clifford Bergman, Giora Slutzki |
Computational Complexity of Some Problems Involving Congruences on Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000, pp. 168-174, 2000, IEEE Computer Society, 0-7695-0725-5. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
fully invariant, subdirectly irreducible, nondeterministic log-space, nondeterministic polynomial time, congruence, simple |
49 | Ville Laurikari |
NFAs with Tagged Transitions, Their Conversion to Deterministic Automata and Application to Regular Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: Seventh International Symposium on String Processing and Information Retrieval, SPIRE 2000, A Coruña, Spain, September 27-29, 2000, pp. 181-187, 2000, IEEE Computer Society, 0-7695-0746-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
tagged transitions, automata conversion, input string position tracking, last-use tracking, nondeterministic Mealy machines, string processing, substring addressing, lookahead operator, regular expressions, finite automata, formal semantics, deterministic automata, nondeterministic finite automata |
43 | Orna Kupferman, Nir Piterman |
Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 182-196, 2009, Springer, 978-3-642-00595-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Orna Kupferman, Gila Morgenstern, Aniello Murano |
Typeness for omega-Regular Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis: Second International Conference, ATVA 2004, Taipei, Taiwan, ROC, October 31-November 3, 2004. Proceedings, pp. 324-338, 2004, Springer, 3-540-23610-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
43 | Michal Walicki, Sigurd Meldal |
A Complete Calculus for the Multialgebraic and Functional Semantics of Nondeterminism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 17(2), pp. 366-393, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
reasoning with nondeterminism, algebraic specifications |
43 | John E. Hopcroft, Jeffrey D. Ullman |
Relations Between Time and Tape Complexities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 15(3), pp. 414-427, 1968. The full citation details ...](Pics/full.jpeg) |
1968 |
DBLP DOI BibTeX RDF |
|
42 | Gordon Fraser 0001, Franz Wotawa |
Test-Case Generation and Coverage Analysis for Nondeterministic Systems Using Model-Checkers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSEA ![In: Proceedings of the Second International Conference on Software Engineering Advances (ICSEA 2007), August 25-31, 2007, Cap Esterel, French Riviera, France, pp. 45, 2007, IEEE Computer Society, 0-7695-2937-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Toshiharu Fujita, Takayuki Ueno, Seiichi Iwamoto |
A Nondeterministic Dynamic Programming Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES ![In: Knowledge-Based Intelligent Information and Engineering Systems, 8th International Conference, KES 2004, Wellington, New Zealand, September 20-25, 2004. Proceedings. Part II, pp. 1208-1214, 2004, Springer, 3-540-23206-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
42 | Lance Fortnow, Dieter van Melkebeek |
Time-Space Tradeoffs for Nondeterministic Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, Florence, Italy, July 4-7, 2000, pp. 2-13, 2000, IEEE Computer Society, 0-7695-0674-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Satisfiability, Time-space tradeoffs |
42 | Lance Fortnow |
Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 52-60, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
39 | Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers |
Inverting Onto Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 213-222, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
function classes, total functions, nondeterministic Turing machines, unambiguous computation, Computational complexity, invertibility |
38 | Jüri Vain, Kullo Raiend, Andres Kull, Juhan P. Ernits |
Synthesis of test purpose directed reactive planning tester for nondeterministic systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: 22nd IEEE/ACM International Conference on Automated Software Engineering (ASE 2007), November 5-9, 2007, Atlanta, Georgia, USA, pp. 363-372, 2007, ACM, 978-1-59593-882-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
nondeterministic extended finite state machine, reactive planning, model-based testing, online testing |
38 | Fan Zhang, To-Yat Cheung |
Optimal Transfer Trees and Distinguishing Trees for Testing Observable Nondeterministic Finite-State Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 29(1), pp. 1-14, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Average weight, distinguishing tree, nondeterministic finite-state machine, transfer tree, weighted height, testing |
38 | Hervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer |
Nondeterministic NC1 Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 12-21, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
nondeterministic Turing machine, leaf language, Computational complexity, circuit |
36 | Yifeng Chen, Jeff W. Sanders |
Unifying Probability with Nondeterminism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FM ![In: FM 2009: Formal Methods, Second World Congress, Eindhoven, The Netherlands, November 2-6, 2009. Proceedings, pp. 467-482, 2009, Springer, 978-3-642-05088-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Thomas A. Henzinger, Nir Piterman |
Solving Games Without Determinization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings, pp. 395-410, 2006, Springer, 3-540-45458-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Juraj Hromkovic, Martin Sauerhoff |
The Power of Nondeterminism and Randomness for Oblivious Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 36(2), pp. 159-182, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
35 | Andrzej S. Murawski |
Reachability Games and Game Semantics: Comparing Nondeterministic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 353-363, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Idealized Algol, pushdown graphs, reachability games, nondeterminism, game semantics |
35 | Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai |
A Time Hierarchy Theorem for Nondeterministic Cellular Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 511-520, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Agnieszka Makarec |
Interpretation of Probabilistic Algorithmic Logic in Nondeterministic Algorithmic Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CISIM ![In: 6th International Conference on Computer Information Systems and Industrial Management Applications, CISIM 2007, Elk, Poland, June 28-30, 2007, pp. 81-86, 2007, IEEE Computer Society, 0-7695-2894-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Kim Solin |
On Two Dually Nondeterministic Refinement Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RelMiCS ![In: Relations and Kleene Algebra in Computer Science, 9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra, RelMiCS/AKA 2006, Manchester, UK, August 29-September 2, 2006, Proceedings, pp. 373-387, 2006, Springer, 3-540-37873-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | François Le Gall |
Quantum Weakly Nondeterministic Communication Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 658-669, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Richard Edwin Stearns |
Deterministic versus nondeterministic time and lower bound problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 50(1), pp. 91-95, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
generic problems, power index, Computational complexity, NP-completeness, time complexity, SAT, nondeterminism, generic algorithms |
35 | Alexandru Mateescu, Arto Salomaa |
Nondeterministic Trajectories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal and Natural Computing ![In: Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002], pp. 96-106, 2002, Springer, 3-540-43190-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
35 | B. F. Melnikov |
Heuristics in Programming of Nondeterministic Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Program. Comput. Softw. ![In: Program. Comput. Softw. 27(5), pp. 277-288, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
35 | Beate Bollig |
Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings, pp. 222-231, 2000, Springer, 3-540-67901-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
35 | Jacques Chassin de Kergommeaux, Michiel Ronsse, Koenraad De Bosschere |
MPL*: Efficient Record/Play of Nondeterministic Features of Message Passing Libraries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PVM/MPI ![In: Recent Advances in Parallel Virtual Machine and Message Passing Interface, 6th European PVM/MPI Users' Group Meeting, Barcelona, Spain, September 26-29, 1999, Proceedings, pp. 141-148, 1999, Springer, 3-540-66549-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
35 | Hiroshi Sakai |
Some Issues on Nondeterministic Knowledge Bases with Incomplete and Selective Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rough Sets and Current Trends in Computing ![In: Rough Sets and Current Trends in Computing, First International Conference, RSCTC'98, Warsaw, Poland, June 22-26, 1998, Proceedings, pp. 424-431, 1998, Springer, 3-540-64655-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
35 | Jirí Wiedermann |
Speeding-up Single-Tape Nondeterministic Computations by Single Alternation, with Separation Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings, pp. 381-392, 1996, Springer, 3-540-61440-0. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
35 | Hong Liu 0004, Raymond E. Miller |
Generalized fair reachability analysis for cyclic protocols with nondeterministic and internal transitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: 1995 International Conference on Network Protocols, ICNP 1995, November 7-10, 1995, Tokyo, Japan, pp. 6-13, 1995, IEEE Computer Society, 0-8186-7216-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
35 | Dietrich Kuske |
Nondeterministic Automata with Concurrency Relations and Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: Trees in Algebra and Programming - CAAP'94, 19th International Colloquium, Edinburgh, UK, April 11-13, 1994, Proceedings, pp. 202-217, 1994, Springer, 3-540-57879-X. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
35 | Viliam Geffert |
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. (journal version: SIAM J. Comput. 20(3): 484-498(1991)) ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings, pp. 111-124, 1990, Springer, 3-540-52826-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
35 | Manfred Broy |
On the Herbrand Kleene Universe for Nondeterministic Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia, September 3-7, 1984, Proceedings, pp. 214-222, 1984, Springer, 3-540-13372-0. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
35 | Peter H. Starke |
On the Representability of Relations by Deterministic and Nondeterministic Multi-Tape Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1975, 4th Symposium, Mariánské Lázne, Czechoslovakia, September 1-5, 1975, Proceedings, pp. 114-124, 1975, Springer, 0-387-07389-2. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
|
35 | Chung Keung Poon |
Space Bounds for Graph Connectivity Problems on Node-named JAGs and Node-ordered JAGs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 218-227, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
nondeterministic NO-JAG, graph connectivity problems, node-named JAGs, node-ordered JAGs, nondeterministic Turing machine, space bounds |
32 | Frank Ciesinski, Marcus Größer |
On Probabilistic Computation Tree Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Validation of Stochastic Systems ![In: Validation of Stochastic Systems - A Guide to Current Research, pp. 147-188, 2004, Springer, 3-540-22265-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
PCTL, PCTL*, probabilistic deterministic systems, probabilistic nondeterministic systems, quantitative model checking, scheduler, fairness, Markov decision processes, discrete time Markov chains |
32 | Wendy MacCaull, Ewa Orlowska |
A Calculus of Typed Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RelMiCS ![In: Relational and Kleene-Algebraic Methods in Computer Science: 7th International Seminar on Relational Methods in Computer Science and 2nd International Workshop on Applications of Kleene Algebra, Bad Malente, Germany, May 12-17, 2003, Revised Selected Papers, pp. 191-201, 2003, Springer, 3-540-22145-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Relational proof system, typed relations, nondeterministic databases, information relations, relational database |
32 | Lucian Ilie, Sheng Yu 0001 |
Constructing NFA s by Optimal Use of Positions in Regular Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings, pp. 279-288, 2002, Springer, 3-540-43862-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
right-invariant equivalence, $varepsilon$-elimination, algorithms, regular expressions, positions, partial derivatives, quotients, regular expression matching, nondeterministic finite automata |
32 | Lucian Ilie, Sheng Yu 0001 |
Algorithms for Computing Small NFAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 328-340, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
follow relations, invariant equivalences, algorithms, regular expressions, positions, partial derivatives, quotients, nondeterministic finite automata |
32 | Tetsuro Katayama, Zengo Furukawa, Kazuo Ushijima |
A Method for Structural Testing of Ada Concurrent Programs Using the Event Interactions Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APSEC ![In: 3rd Asia-Pacific Software Engineering Conference (APSEC '96), December 4-7, 1996, Seoul, South Korea, pp. 355-, 1996, IEEE Computer Society, 0-8186-7638-8. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Ada programming language, Event InterActions Graph(EIAG), nondeterministic execution, software testing, concurrent programs, test-cases, structural testing, testing criteria |
31 | Shaobo Liu, Meikang Qiu, Wenzhong Gao, Xiao-jun Tang, Bin Guo |
Hybrid of Job Sequencing and DVFS for Peak Temperature Reduction with Nondeterministic Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: 10th IEEE International Conference on Computer and Information Technology, CIT 2010, Bradford, West Yorkshire, UK, June 29-July 1, 2010, pp. 1780-1787, 2010, IEEE Computer Society, 978-0-7695-4108-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
peak temperature, nondeterministic, embedded systems, Thermal management |
31 | Kumar V. Vadaparty, Shamim A. Naqvi |
Using Constraints for Efficient Query Processing in Nondeterministic Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 7(6), pp. 850-864, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Nondeterministic data, efficiency of query processing, constraints |
31 | James R. Russell |
Full Abstraction for Nondeterministic Dataflow Networks ![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. 170-175, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
input-output relation, nondeterministic dataflow networks, bounded choice, semantic models, full abstraction |
29 | Christian Dax, Felix Klaedtke |
Alternation Elimination by Complementation (Extended Abstract). ![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. 214-229, 2008, Springer, 978-3-540-89438-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Galina Jirásková |
On the State Complexity of Complements, Stars, and Reversals of Regular Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings, pp. 431-442, 2008, Springer, 978-3-540-85779-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Orna Kupferman, Moshe Y. Vardi |
Safraless Decision Procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pp. 531-542, 2005, IEEE Computer Society, 0-7695-2468-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Lynette van Zijl |
Magic Numbers for Symmetric Difference NFAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers, pp. 333-334, 2004, Springer, 3-540-24318-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Atsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki |
Some Properties of One-Pebble Turing Machines with Sublogarithmic Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 635-644, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Philipp Woelfel |
A Lower Bound Technique for Restricted Branching Programs and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 431-442, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Alessandro Aldini |
Probabilistic Information Flow in a Process Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings, pp. 152-168, 2001, Springer, 3-540-42497-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Orna Kupferman, Nir Piterman, Moshe Y. Vardi |
Extended Temporal Logic Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings, pp. 519-535, 2001, Springer, 3-540-42497-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Rahul Santhanam |
On Separators, Segregators and Time versus Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 286-294, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Peter Bro Miltersen, N. V. Vinodchandran |
Derandomizing Arthur-Merlin Games Using Hitting Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 71-80, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
derandomization, hitting sets, Arthur-Merlin games |
29 | Hing Leung |
On Finite Automata with Limited Nondeterminism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 35(7), pp. 595-624, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
29 | Carlo Mereghetti, Giovanni Pighizzini |
Optimal Simulations Between Unary Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings, pp. 139-149, 1998, Springer, 3-540-64230-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
29 | Vikraman Arvind, Johannes Köbler, Martin Mundhenk |
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 12th Conference, New Delhi, India, December 18-20, 1992, Proceedings, pp. 140-151, 1992, Springer, 3-540-56287-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
29 | Lane A. Hemachandra, Albrecht Hoene |
Collapsing Degrees via Strong Computation (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings, pp. 393-404, 1991, Springer, 3-540-54233-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
29 | Maria Zamfir |
Initial Algebra Semantics and Concurrency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFPS ![In: Mathematical Foundations of Programming Language Semantics, 3rd Workshop, Tulane University, New Orleans, Louisiana, USA, April 8-10, 1987, Proceedings, pp. 528-549, 1987, Springer, 3-540-19020-1. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
29 | Oscar H. Ibarra, Sam M. Kim, Louis E. Rosier |
Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium, July 16-20, 1984, Proceedings, pp. 247-259, 1984, Springer, 3-540-13345-3. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
28 | Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse |
Nondeterministic Graph Searching: From Pathwidth to Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(3), pp. 358-373, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Treewidth, Graph searching, Pathwidth |
28 | Benjamin Aminof, Orna Kupferman, Omer Lev |
On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata. ![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. 183-197, 2008, Springer, 978-3-540-89438-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Oana Agrigoroaiei, Gabriel Ciobanu |
Non-interleaving Semantics with Causality for Nondeterministic Dataflow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2008, 5th International Colloquium, Istanbul, Turkey, September 1-3, 2008. Proceedings, pp. 66-80, 2008, Springer, 978-3-540-85761-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Markus Holzer 0001, Martin Kutrib |
Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings, pp. 1-16, 2008, Springer, 978-3-540-70843-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Hermann Gruber, Markus Holzer 0001 |
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings, pp. 205-216, 2007, Springer, 978-3-540-73207-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Junfeng Wu, Huaikou Miao |
A Rewriting Based Model for Nondeterministic Composite Web Service System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICEBE ![In: Proceedings of ICEBE 2007, IEEE International Conference on e-Business Engineering and the Workshops SOAIC 2007, SOSE 2007, SOKM 2007, 24-26 October, 2007, Hong Kong, China, pp. 492-499, 2007, IEEE Computer Society, 0-7695-3003-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Gordon Fraser 0001, Franz Wotawa |
Nondeterministic Testing with Linear Model-Checker Counterexamples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QSIC ![In: Seventh International Conference on Quality Software (QSIC 2007), 11-12 October 2007, Portland, Oregon, USA, pp. 107-116, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Pascal Van Hentenryck, Laurent Michel |
Nondeterministic Control for Hybrid Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 11(4), pp. 353-373, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
hybrid search, search procedure, local search, checkpoint, continuation, closure, non determinism, solution, constraint language |
28 | Hermann Gruber, Markus Holzer 0001 |
Finding Lower Bounds for Nondeterministic State Complexity Is Hard. ![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. 363-374, 2006, Springer, 3-540-35428-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Alexander Brodsky 0001, Hadon Nash |
CoJava: Optimization Modeling by Nondeterministic Simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings, pp. 91-106, 2006, Springer, 3-540-46267-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Laurent Michel, Andrew See, Pascal Van Hentenryck |
High-Level Nondeterministic Abstractions in. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings, pp. 359-374, 2006, Springer, 3-540-46267-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Felipe W. Trevizan, Fábio Gagliardi Cozman, Leliane Nunes de Barros |
Unifying Nondeterministic and Probabilistic Planning Through Imprecise Markov Decision Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IBERAMIA-SBIA ![In: Advances in Artificial Intelligence - IBERAMIA-SBIA 2006, 2nd International Joint Conference, 10th Ibero-American Conference on AI, 18th Brazilian AI Symposium, Ribeirão Preto, Brazil, October 23-27, 2006, Proceedings, pp. 502-511, 2006, Springer, 3-540-45462-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Alessandro Giua, Daniele Corona, Carla Seatzu |
State Estimation of lambda-free Labeled Petri Nets with Contact-Free Nondeterministic Transitions*. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 15(1), pp. 85-108, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
labeled nets, marking estimation, Petri nets, observer |
28 | Pascal Van Hentenryck, Laurent Michel |
Nondeterministic Control for Hybrid Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 30 - June 1, 2005, Proceedings, pp. 380-395, 2005, Springer, 3-540-26152-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Christos A. Kapoutsis |
Removing Bidirectionality from Nondeterministic Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 544-555, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse |
Nondeterministic Graph Searching: From Pathwidth to Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 364-375, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
treewidth, graph searching, pathwidth |
28 | Jörg Flum, Martin Grohe, Mark Weyer |
Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 555-567, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Manfred Broy |
A Functional Calculus for Specification and Verification of Nondeterministic Interactive Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Verification: Theory and Practice ![In: Verification: Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, pp. 161-181, 2003, Springer, 3-540-21002-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Sankar Gurumurthy, Orna Kupferman, Fabio Somenzi, Moshe Y. Vardi |
On Complementing Nondeterministic Büchi Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHARME ![In: Correct Hardware Design and Verification Methods, 12th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2003, L'Aquila, Italy, October 21-24, 2003, Proceedings, pp. 96-110, 2003, Springer, 3-540-20363-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Peter A. Dinda, Dong Lu |
Nondeterministic Queries in a Relational Grid Information Service. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SC ![In: Proceedings of the ACM/IEEE SC2003 Conference on High Performance Networking and Computing, 15-21 November 2003, Phoenix, AZ, USA, CD-Rom, pp. 12, 2003, ACM, 1-58113-695-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Bernd Finkbeiner |
Language Containment Checking with Nondeterministic BDDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems, 7th International Conference, TACAS 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, Proceedings, pp. 24-38, 2001, Springer, 3-540-41865-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Anne Brüggemann-Klein, Derick Wood |
Regularly Extended Two-Way Nondeterministic Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata, 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers, pp. 57-66, 2000, Springer, 3-540-42491-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Jirí Wiedermann |
Speeding-Up Nondeterministic Single-Tape Off-Line Computations by One Alternation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 607-615, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 2336 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|