Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Dongkil Tak
@inproceedings{DBLP:conf/npc/TakBYC05, author = {Dongkil Tak and Yongeun Bae and Chunkyun Youn and Ilyong Chung}, editor = {Hai Jin and Daniel A. Reed and Wenbin Jiang}, title = {A Parallel Routing Algorithm on Circulant Networks Employing the Hamiltonian Circuit Latin Square}, booktitle = {Network and Parallel Computing, {IFIP} International Conference, {NPC} 2005, Beijing, China, November 30 - December 3, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3779}, pages = {172--175}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11577188\_22}, doi = {10.1007/11577188\_22}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/npc/TakBYC05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/pdcat/ChoTC04, author = {Youngjoo Cho and Dongkil Tak and Ilyong Chung}, editor = {Kim{-}Meow Liew and Hong Shen and Simon See and Wentong Cai and Pingzhi Fan and Susumu Horiguchi}, title = {A Parallel Routing Algorithm on 2-Circulant Networks Employing the Hamiltonian Circuit Latin Square}, booktitle = {Parallel and Distributed Computing: Applications and Technologies, 5th International Conference, {PDCAT} 2004, Singapore, December 8-10, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3320}, pages = {293--296}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30501-9\_61}, doi = {10.1007/978-3-540-30501-9\_61}, timestamp = {Fri, 12 Jun 2020 16:01:21 +0200}, biburl = {https://dblp.org/rec/conf/pdcat/ChoTC04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.