Dangos 11 - 20 canlyniadau o 24 ar gyfer chwilio '"Computation by abstract devices."', amser ymholiad: 0.02e Mireinio'r Canlyniadau
  1. 11

    Lower bounds on the bounded coefficient complexity of bilinear maps. gan Bürgisser, Peter

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

    Lower bounds on the bounded coefficient complexity of bilinear maps.
  2. 12

    A modified cognitive information complexity measure of software. gan Kushwaha, Dharmender Singh

    Erthygl

    A modified cognitive information complexity measure of software.
  3. 13

    Generating optimal distinguishing sequences with a model checker. gan Robinson-Mallett, Christopher

    Erthygl

    Generating optimal distinguishing sequences with a model checker.
  4. 14

    Scenarios and state machines: models, algorithms, and tools a summary of the 4th workshop. gan Bontemps, Yves

    Erthygl

    Scenarios and state machines: models, algorithms, and tools a summary of the 4th workshop.
  5. 15

    Strategic directions in concurrency research. gan Cleaveland, Rance

    Cyhoeddwyd yn ACM computing surveys.
    Erthygl

    Strategic directions in concurrency research.
  6. 16

    Concurrent zero-knowledge. gan Dwork, Cynthia

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

    Concurrent zero-knowledge.
  7. 17

    Monadic datalog and the expressive power of languages for Web information extraction. gan Gottlob, Georg

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

    Monadic datalog and the expressive power of languages for Web information extraction.
  8. 18

    Register-machine based processes. gan Bergstra, Jan A.

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

    Register-machine based processes.
  9. 19

    Improved implementations of binary universal operations. gan Attiya, Hagit

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

    Improved implementations of binary universal operations.
  10. 20

    Quantum lower bounds by polynomials. gan Beals, Robert

    Cyhoeddwyd yn Journal of the ACM
    Erthygl

    Quantum lower bounds by polynomials.

Offerynnau Chwilio: