Showing 21 - 30 results of 50 for search '"Discrete mathematics."', query time: 0.02s Refine Results
  1. 21

    Time-work tradeoffs for parallel algorithms. by Spencer, Thomas H.

    Published in Journal of the ACM
    Article

    Time-work tradeoffs for parallel algorithms.
  2. 22

    Polynomial-time data reduction for dominating set. by Alber, Jochen

    Published in Journal of the ACM
    Article

    Polynomial-time data reduction for dominating set.
  3. 23

    Weighted coloring based channel assignment for WLANs. by Mishra, Arunesh

    Article

    Weighted coloring based channel assignment for WLANs.
  4. 24

    Distributed, scalable routing based on link-state vectors. by Behrens, Jochen

    Article

    Distributed, scalable routing based on link-state vectors.
  5. 25

    Open shortest path first (OSPF) routing protocol simulation. by Sidhu, Deepinder

    Article

    Open shortest path first (OSPF) routing protocol simulation.
  6. 26

    Core based trees (CBT). by Ballardie, Tony

    Article

    Core based trees (CBT).
  7. 27

    Delayed Internet routing convergence. by Labovitz, Craig

    Article

    Delayed Internet routing convergence.
  8. 28

    STAR a transparent spanning tree bridge protocol with alternate routing. by Lui, King-Shan

    Article

    STAR a transparent spanning tree bridge protocol with alternate routing.
  9. 29

    The internet AS-level topology three data sources and one definitive metric. by Mahadevan, Priya

    Article

    The internet AS-level topology three data sources and one definitive metric.
  10. 30

    Almost tight upper bounds for vertical decompositions in four dimensions. by Koltun, Vladlen

    Published in Journal of the ACM
    Article

    Almost tight upper bounds for vertical decompositions in four dimensions.

Search Tools: