Search

Your search keyword '"Pnueli, A."' showing total 174 results

Search Constraints

Start Over You searched for: Author "Pnueli, A." Remove constraint Author: "Pnueli, A." Topic turing machine Remove constraint Topic: turing machine
174 results on '"Pnueli, A."'

Search Results

1. Refining the Undecidability Frontier of Hybrid Automata

2. Computable Quantifiers and Logics over Finite Structures

3. Oracles and quantifiers

4. Refining the Undecidability Frontier of Hybrid Automata

5. Computable Quantifiers and Logics over Finite Structures

6. Bounded reductions

7. Functional oracle queries as a measure of parallel time

8. Nondeterminism within P

9. Interactive proof systems and alternating time-space complexity

11. The owner concept for PRAMs

14. One-way functions in complexity theory

15. Type inference problems: A survey

16. Restricted branching programs and their computational power

19. Speed-up theorem without tape compression

20. Using inductive counting to simulate nondeterministic computation

21. Oracles versus proof techniques that do not relativize

22. Structural complexity theory: Recent surprises

23. Additional queries to random and pseudorandom oracles

24. A formal study of learning via queries

27. Ω-branching programs of bounded width

28. On the power of bounded concurrency II: The pushdown automata level

29. The complexity of graph problems for succinctly represented graphs

30. A note on the almost-everywhere hierarchy for nondeterministic time

31. Counting classes: Thresholds, parity, mods, and fewness

32. Efficient checking of computations

33. Combinatorial rewriting on traces

34. On the Complexity of Pseudo-Random Sequences - or: If You Can Describe a Sequence It Can’t be Random

36. On the formal aspects of approximation algorithms

37. Some remarks on polynomial time isomorphisms

38. Hardware algorithms for VLSI systems

39. Connections with language theory

41. A survey of two-dimensional automata theory

43. Complexity theory and formal languages

46. Direct Minimum-Knowledge Computations (Extended Abstract)

47. The computational complexity of cellular automata

49. Extensional properties of sets of time bounded complexity (extended abstract)

50. Complexity classes with complete problems between P and NP-C

Catalog

Books, media, physical & digital resources