𝔖 Bobbio Scriptorium
✦   LIBER   ✦

First search for

✍ Scribed by Nix, J.; Ahn, J. K.; Akune, Y.; Baranov, V.; Doroshenko, M.; Fujioka, Y.; Hsiung, Y. B.; Inagaki, T.; Ishibashi, S.; Ishihara, N.; Ishii, H.; Iwai, E.; Iwata, T.; Kobayashi, S.; Komatsubara, T. K.; Kurilin, A. S.; Kuzmin, E.; Lednev, A.; Lee, H. S.; Lee, S. Y.; Lim, G. Y.; Matsumura, T.; Moisseenko, A.; Morii, H.; Morimoto, T.; Nakano, T.; Nomura, T.; Nomachi, M.; Okuno, H.; Omata, K.; Perdue, G. N.; Perov, S.; Podolsky, S.; Porokhovoy, S.; Sakashita, K.; Sasao, N.; Sato, H.; Sato, T.; Sekimoto, M.; Shinkawa, T.; Sugaya, Y.; Sugiyama, A.; Sumida, T.; Tajima, Y.; Tsamalaidze, Z.; Tsukamoto, T.; Wah, Y.; Watanabe, H.; Yamaga, M.; Yamanaka, T.; Yoshida, H. Y.; Yoshimura, Y.

Book ID
127001238
Publisher
The American Physical Society
Year
2007
Tongue
English
Weight
368 KB
Volume
76
Category
Article
ISSN
1550-7998

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Distributed algorithms for depth-first s
Distributed algorithms for depth-first search
✍ S.A.M. Makki; George Havas πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 497 KB

We present distributed algorithms for constructing a depth-first search tree for a communication network which are more efficient than previous methods. Our algorithms require 21VI -2 messages and units of time in the worst case, where IV1 is the number of sites in the network, and as little as IV1

The first extensive search for sdO pulsa
The first extensive search for sdO pulsators
✍ C. RodrΓ­guez-LΓ³pez; A. Ulla; R. Garrido πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 674 KB
Search for first-generation leptoquarks
Search for first-generation leptoquarks at HERA
✍ Abramowicz, H.; Abt, I.; Adamczyk, L.; Adamus, M.; Aggarwal, R.; Antonelli, S.; πŸ“‚ Article πŸ“… 2012 πŸ› The American Physical Society 🌐 English βš– 998 KB