Mostra 51 - 60 risultati di 146 ricerca '"Theory of Computation."', tempo di risposta: 0,02s Raffina i risultati
  1. 51

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

    Pubblicato in Journal of the ACM
    Articolo

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

    Satisfiability of word equations with constants is in PSPACE. di Plandowski, Wojciech

    Pubblicato in Journal of the ACM
    Articolo

    Satisfiability of word equations with constants is in PSPACE.
  3. 53

    On clusterings good, bad and spectral. di Kannan, Ravi

    Pubblicato in Journal of the ACM
    Articolo

    On clusterings good, bad and spectral.
  4. 54

    Mobile routing for large scale all-IP wireless network. di Li, Hongyi

    Articolo

    Mobile routing for large scale all-IP wireless network.
  5. 55

    Routing and handoff in the edge mobility architecture. di O'Neill, Alan

    Articolo

    Routing and handoff in the edge mobility architecture.
  6. 56

    An approximate analysis of the shortest queue policy on soft real-time scheduling. di Zhu, Weiping

    Articolo

    An approximate analysis of the shortest queue policy on soft real-time scheduling.
  7. 57

    A specification language for coordinated objects. di Ciobanu, Gabriel

    Articolo

    A specification language for coordinated objects.
  8. 58

    Evaluating and tuning a static analysis to find null pointer bugs. di Hovemeyer, David

    Articolo

    Evaluating and tuning a static analysis to find null pointer bugs.
  9. 59

    Symbolic path simulation in path-sensitive dataflow analysis. di Hampapuram, Hari

    Articolo

    Symbolic path simulation in path-sensitive dataflow analysis.
  10. 60

    String analysis for x86 binaries. di Christodorescu, Mihai

    Articolo

    String analysis for x86 binaries.

Strumenti per la ricerca: