Search Results

There are 6414 results for: content related to: Study of simulation method of time evolution in rigged QED

  1. Graph bootstrap percolation

    Random Structures & Algorithms

    Volume 41, Issue 4, December 2012, Pages: 413–440, József Balogh, Béla Bollobás and Robert Morris

    Article first published online : 4 SEP 2012, DOI: 10.1002/rsa.20458

  2. 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

    Article first published online : 23 NOV 2011, DOI: 10.1002/rsa.20387

  3. Turánnical hypergraphs

    Random Structures & Algorithms

    Volume 42, Issue 1, January 2013, Pages: 29–58, Peter Allen, Julia Böttcher, Jan Hladký and Diana Piguet

    Article first published online : 18 FEB 2012, DOI: 10.1002/rsa.20399

  4. Traffic grooming in bidirectional WDM ring networks

    Networks

    Volume 58, Issue 1, August 2011, Pages: 20–35, Jean-Claude Bermond, Xavier Muñoz and Ignasi Sau

    Article first published online : 22 DEC 2010, DOI: 10.1002/net.20410

  5. Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges

    Random Structures & Algorithms

    Volume 40, Issue 3, May 2012, Pages: 350–384, Ilan Gronau, Shlomo Moran and Sagi Snir

    Article first published online : 31 MAY 2011, DOI: 10.1002/rsa.20372

  6. Survivability in hierarchical telecommunications networks

    Networks

    Volume 59, Issue 1, January 2012, Pages: 37–58, Pierre Fouilhoux, Oya Ekin Karasan, A. Ridha Mahjoub, Onur Özkök and Hande Yaman

    Article first published online : 25 NOV 2011, DOI: 10.1002/net.20479

  7. Formulations for dynamic lot sizing with service levels

    Naval Research Logistics (NRL)

    Volume 60, Issue 2, March 2013, Pages: 87–101, Dinakar Gade and Simge Küçükyavuz

    Article first published online : 9 JAN 2013, DOI: 10.1002/nav.21519

  8. Asymptotic enumeration of strongly connected digraphs by vertices and edges

    Random Structures & Algorithms

    Volume 43, Issue 1, August 2013, Pages: 80–114, Xavier Pérez-Giménez and Nicholas Wormald

    Article first published online : 26 APR 2012, DOI: 10.1002/rsa.20416

  9. Capacity games for partially complementary products under multivariate random demands

    Naval Research Logistics (NRL)

    Volume 59, Issue 2, March 2012, Pages: 146–159, Xiang Fang

    Article first published online : 10 FEB 2012, DOI: 10.1002/nav.21478

  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

    Article first published online : 15 SEP 2010, DOI: 10.1002/rsa.20342

  11. Edge-disjoint Hamilton cycles in random graphs

    Random Structures & Algorithms

    Fiachra Knox, Daniela Kühn and Deryk Osthus

    Article first published online : 2 JUL 2013, DOI: 10.1002/rsa.20510

  12. Sparse random graphs with clustering

    Random Structures & Algorithms

    Volume 38, Issue 3, May 2011, Pages: 269–323, Béla Bollobás, Svante Janson and Oliver Riordan

    Article first published online : 28 APR 2010, DOI: 10.1002/rsa.20322

  13. Dual sourcing: Responsive hedging against correlated supply and demand uncertainty

    Naval Research Logistics (NRL)

    Volume 59, Issue 1, February 2012, Pages: 69–89, Fabian J. Sting and Arnd Huchzermeier

    Article first published online : 5 JAN 2012, DOI: 10.1002/nav.21473

  14. Joint inventory and pricing decisions for perishable products with two-period lifetime

    Naval Research Logistics (NRL)

    Volume 60, Issue 5, August 2013, Pages: 343–366, Li-Ming Chen and Amar Sapra

    Article first published online : 12 JUN 2013, DOI: 10.1002/nav.21538

  15. Convergence analysis of some high–order time accurate schemes for a finite volume method for second order hyperbolic equations on general nonconforming multidimensional spatial meshes

    Numerical Methods for Partial Differential Equations

    Volume 29, Issue 4, July 2013, Pages: 1278–1321, Abdallah Bradji

    Article first published online : 5 DEC 2012, DOI: 10.1002/num.21755

  16. Hitting time results for Maker-Breaker games

    Random Structures & Algorithms

    Volume 41, Issue 1, August 2012, Pages: 23–46, Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz and Michael Krivelevich

    Article first published online : 31 DEC 2011, DOI: 10.1002/rsa.20392

  17. Characterizing optimal sampling of binary contingency tables via the configuration model

    Random Structures & Algorithms

    Volume 42, Issue 2, March 2013, Pages: 159–184, Jose Blanchet and Alexandre Stauffer

    Article first published online : 13 FEB 2012, DOI: 10.1002/rsa.20403

  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

    Article first published online : 29 FEB 2012, DOI: 10.1002/rsa.20398

  19. Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

    Naval Research Logistics (NRL)

    Volume 58, Issue 8, December 2011, Pages: 763–770, T.C. Edwin Cheng, Qingqin Nong and Chi To Ng

    Article first published online : 18 OCT 2011, DOI: 10.1002/nav.20484

  20. Inspection games with local and global allocation bounds

    Naval Research Logistics (NRL)

    Volume 60, Issue 2, March 2013, Pages: 125–140, Yael Deutsch, Boaz Golany, Noam Goldberg and Uriel G. Rothblum

    Article first published online : 6 FEB 2013, DOI: 10.1002/nav.21524