Mostra 341 - 350 risultati di 389 ricerca 'Journal of algorithms.', tempo di risposta: 0,02s Raffina i risultati
  1. 341

    Spatial gossip and resource location protocols. di Kempe, D.

    Pubblicato in Journal of the ACM
    Articolo

    Spatial gossip and resource location protocols.
  2. 342

    A new approach to dynamic all pairs shortest paths. di Demetrescu, Camil

    Pubblicato in Journal of the ACM
    Articolo

    A new approach to dynamic all pairs shortest paths.
  3. 343

    Compact oracles for reachability and approximate distances in planar diagraphs. di Thorup, M.

    Pubblicato in Journal of the ACM
    Articolo

    Compact oracles for reachability and approximate distances in planar diagraphs.
  4. 344

    Automatic information extraction from large websites. di Crescenzi, Valter

    Pubblicato in Journal of the ACM
    Articolo

    Automatic information extraction from large websites.
  5. 345

    Self-stabilizing clock synchronization in the presence of Byzantine faults. di Dolev, Shlomi

    Pubblicato in Journal of the ACM
    Articolo

    Self-stabilizing clock synchronization in the presence of Byzantine faults.
  6. 346

    Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. di Becchetti, Luca

    Pubblicato in Journal of the ACM
    Articolo

    Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines.
  7. 347

    Solving convex programs by random walks. di Bertsimas, D.

    Pubblicato in Journal of the ACM
    Articolo

    Solving convex programs by random walks.
  8. 348

    Quantum lower bounds for the collision and the element distinctness problems. di Aaronson, Scott

    Pubblicato in Journal of the ACM
    Articolo

    Quantum lower bounds for the collision and the element distinctness problems.
  9. 349

    Approximating extent measures of points. di Agarwal, Pankaj K.

    Pubblicato in Journal of the ACM
    Articolo

    Approximating extent measures of points.
  10. 350

    Number-theoretic constructions of efficient pseudo-random functions. di Naor, Moni

    Pubblicato in Journal of the ACM
    Articolo

    Number-theoretic constructions of efficient pseudo-random functions.

Strumenti per la ricerca: