Home Modelling and search complexity in multiprocessor Systems
Article
Licensed
Unlicensed Requires Authentication

Modelling and search complexity in multiprocessor Systems

  • E. E. GASANOV and E. R. EROKHINA
Published/Copyright: October 9, 2009
Become an author with De Gruyter Brill
Author Information Explore this Subject
Discrete Mathematics and Applications
From the journal Volume 9 Issue 5

Published Online: 2009-10-09
Published in Print: 1999

Walter de Gruyter

Articles in the same Issue

  1. Titelei
  2. Random correspondences, binary matrices, and runs
  3. Probabilities of events related to common predecessors of two vertices in the generalized model of recursive trees
  4. Structure-complex systems with threshold survival
  5. A fast method to transform continued fractions to common fractions
  6. On the spectra of connected graphs
  7. Modelling and search complexity in multiprocessor Systems
  8. On some properties of three-index transportation polytopes
https://doi.org/10.1515/dma.1999.9.5.523

Articles in the same Issue

  1. Titelei
  2. Random correspondences, binary matrices, and runs
  3. Probabilities of events related to common predecessors of two vertices in the generalized model of recursive trees
  4. Structure-complex systems with threshold survival
  5. A fast method to transform continued fractions to common fractions
  6. On the spectra of connected graphs
  7. Modelling and search complexity in multiprocessor Systems
  8. On some properties of three-index transportation polytopes
Sign up now to receive a 20% welcome discount
Institutional Access
How does access work?
Have an idea on how to improve our website?
Please write us.
© 2025 De Gruyter Brill
Downloaded on 27.10.2025 from https://www.degruyterbrill.com/document/doi/10.1515/dma.1999.9.5.523/html
Scroll to top button