Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Asano T"'
Autor:
Berg, de, M., Devillers, O., Kreveld, van, M.J., Schwarzkopf, O., Teillaud, M., Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S.
Publikováno v:
Algorithms and Computation (Proceedings 7th International Symposium, ISAAC'96, Osaka, Japan, December 16-18, 1996), 126-135
STARTPAGE=126;ENDPAGE=135;TITLE=Algorithms and Computation (Proceedings 7th International Symposium, ISAAC'96, Osaka, Japan, December 16-18, 1996)
Algorithms and Computation ISBN: 9783540620488
ISAAC
Theory of Computing Systems, 31(5), 613-628. Springer
Scopus-Elsevier
RR-2832, INRIA. 1996
Theory of Computing Systems
Theory of Computing Systems, 1998, 31, pp.613-628. ⟨10.1007/PL00005845⟩
International Symposium on Algorithms and Computation
International Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.126-135
STARTPAGE=126;ENDPAGE=135;TITLE=Algorithms and Computation (Proceedings 7th International Symposium, ISAAC'96, Osaka, Japan, December 16-18, 1996)
Algorithms and Computation ISBN: 9783540620488
ISAAC
Theory of Computing Systems, 31(5), 613-628. Springer
Scopus-Elsevier
RR-2832, INRIA. 1996
Theory of Computing Systems
Theory of Computing Systems, 1998, 31, pp.613-628. ⟨10.1007/PL00005845⟩
International Symposium on Algorithms and Computation
International Symposium on Algorithms and Computation, 1996, Osaka, Japan. pp.126-135
Finding a vast array of applications, the list-ranking problem has emerged as one of the fundamental techniques in parallel algorithm design. Surprisingly, the best previously known algorithm to rank a list of n items on a reconfigurable mesh of size
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::257cfb14e06b8357c3c084e96744d47b
https://research.tue.nl/nl/publications/e1c61e53-0788-44c7-8d1f-152a89154dab
https://research.tue.nl/nl/publications/e1c61e53-0788-44c7-8d1f-152a89154dab