Search Results

There are 7856 results for: content related to: Nonblocking multirate log 2 ( N , m , p ) switching networks with multicast connections

  1. Tolerant identification with Euclidean balls

    Networks

    Volume 61, Issue 3, May 2013, Pages: 212–225, Ville Junnila, Tero Laihonen and Aline Parreau

    Version of Record online : 18 JUL 2012, DOI: 10.1002/net.21472

  2. On the cut-off phenomenon for the transitivity of randomly generated subgroups

    Random Structures & Algorithms

    Volume 40, Issue 2, March 2012, Pages: 182–219, André Galligo and Laurent Miclo

    Version of Record online : 2 JUN 2011, DOI: 10.1002/rsa.20369

  3. The CRT is the scaling limit of unordered binary trees

    Random Structures & Algorithms

    Volume 38, Issue 4, July 2011, Pages: 467–501, Jean-François Marckert and Grégory Miermont

    Version of Record online : 25 MAY 2010, DOI: 10.1002/rsa.20332

  4. Critical window for the vacant set left by random walk on random regular graphs

    Random Structures & Algorithms

    Volume 43, Issue 3, October 2013, Pages: 313–337, Jiří Černý and Augusto Teixeira

    Version of Record online : 12 MAY 2012, DOI: 10.1002/rsa.20425

  5. A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems

    Networks

    Volume 62, Issue 1, August 2013, Pages: 56–71, Minghe Sun

    Version of Record online : 7 JAN 2013, DOI: 10.1002/net.21493

  6. Large deviation analysis for layered percolation problems on the complete graph

    Random Structures & Algorithms

    Volume 40, Issue 4, July 2012, Pages: 460–492, Lincoln Chayes and S. Alex Smith

    Version of Record online : 23 NOV 2011, DOI: 10.1002/rsa.20387

  7. Computation of the optimal value function in time-dependent networks

    Networks

    Volume 62, Issue 2, September 2013, Pages: 105–124, Sebastian Kluge, Konrad Reif and Martin Brokate

    Version of Record online : 2 MAY 2013, DOI: 10.1002/net.21501

  8. Robust network design: Formulations, valid inequalities, and computations

    Networks

    Volume 61, Issue 2, March 2013, Pages: 128–149, Arie M.C.A. Koster, Manuel Kutschka and Christian Raack

    Version of Record online : 28 JAN 2013, DOI: 10.1002/net.21497

  9. The maximal probability that k-wise independent bits are all 1

    Random Structures & Algorithms

    Volume 38, Issue 4, July 2011, Pages: 502–525, Ron Peled, Ariel Yadin and Amir Yehudayoff

    Version of Record online : 25 MAY 2010, DOI: 10.1002/rsa.20329

  10. Anatomy of a young giant component in the random graph

    Random Structures & Algorithms

    Volume 39, Issue 2, September 2011, Pages: 139–178, Jian Ding, Jeong Han Kim, Eyal Lubetzky and Yuval Peres

    Version of Record online : 15 SEP 2010, DOI: 10.1002/rsa.20342

  11. Sharp load thresholds for cuckoo hashing

    Random Structures & Algorithms

    Volume 41, Issue 3, October 2012, Pages: 306–333, Nikolaos Fountoulakis and Konstantinos Panagiotou

    Version of Record online : 12 MAY 2012, DOI: 10.1002/rsa.20426

  12. Atomic representations in function spaces and applications to pointwise multipliers and diffeomorphisms, a new approach

    Mathematische Nachrichten

    Volume 286, Issue 2-3, February 2013, Pages: 283–305, Benjamin Scharf

    Version of Record online : 15 OCT 2012, DOI: 10.1002/mana.201100336

  13. Critical behavior in inhomogeneous random graphs

    Random Structures & Algorithms

    Volume 42, Issue 4, July 2013, Pages: 480–508, Remco van der Hofstad

    Version of Record online : 28 AUG 2012, DOI: 10.1002/rsa.20450

  14. A phase transition for the heights of a fragmentation tree

    Random Structures & Algorithms

    Volume 39, Issue 2, September 2011, Pages: 247–274, Adrien Joseph

    Version of Record online : 29 SEP 2010, DOI: 10.1002/rsa.20340

  15. Depth Properties of scaled attachment random recursive trees

    Random Structures & Algorithms

    Volume 41, Issue 1, August 2012, Pages: 66–98, Luc Devroye, Omar Fawzi and Nicolas Fraiman

    Version of Record online : 23 DEC 2011, DOI: 10.1002/rsa.20391

  16. Numerical approaches to thermally coupled perfect plasticity

    Numerical Methods for Partial Differential Equations

    Volume 29, Issue 6, November 2013, Pages: 1837–1863, Sören Bartels and Tomáš Roubíček

    Version of Record online : 3 APR 2013, DOI: 10.1002/num.21779

  17. Affine recourse for the robust network design problem: Between static and dynamic routing

    Networks

    Volume 61, Issue 2, March 2013, Pages: 180–198, Michael Poss and Christian Raack

    Version of Record online : 7 SEP 2012, DOI: 10.1002/net.21482

  18. Sharp kernel clustering algorithms and their associated Grothendieck inequalities

    Random Structures & Algorithms

    Volume 42, Issue 3, May 2013, Pages: 269–300, Subhash Khot and Assaf Naor

    Version of Record online : 29 FEB 2012, DOI: 10.1002/rsa.20398

  19. Uncertainty feature optimization: An implicit paradigm for problems with noisy data

    Networks

    Volume 57, Issue 3, May 2011, Pages: 270–284, Niklaus Eggenberg, Matteo Salani and Michel Bierlaire

    Version of Record online : 3 FEB 2011, DOI: 10.1002/net.20428

  20. On large (Δ, D, D, 1)-graphs

    Networks

    Volume 57, Issue 4, July 2011, Pages: 316–327, J. Gómez, J. Fàbrega and J.L.A. Yebra

    Version of Record online : 18 AUG 2010, DOI: 10.1002/net.20401