![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Octavian Procopiuc Octavian Procopiuc, Pankaj K. Agarwal , Lars Arge , Jeffrey Scott Vitter : Bkd-Tree: A Dznamic Scalable kd-Tree. SSTD 2003 : 46-65 Lars Arge , Octavian Procopiuc, Jeffrey Scott Vitter : Implementing I/O-efficient Data Structures Using TPIE. ESA 2002 : 88-100 Pankaj K. Agarwal , Lars Arge , Octavian Procopiuc, Jeffrey Scott Vitter : A Framework for Index Bulk Loading and Dynamization. ICALP 2001 : 115-127 Lars Arge , Octavian Procopiuc, Sridhar Ramaswamy , Torsten Suel , Jan Vahrenhold , Jeffrey Scott Vitter : A Unified Approach for Indexed and Non-Indexed Spatial Joins. EDBT 2000 : 413-429 Lars Arge , Octavian Procopiuc, Sridhar Ramaswamy , Torsten Suel , Jeffrey Scott Vitter : Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract). SODA 1998 : 685-694 Lars Arge , Octavian Procopiuc, Sridhar Ramaswamy , Torsten Suel , Jeffrey Scott Vitter : Scalable Sweeping-Based Spatial Join. VLDB 1998 : 570-581 Susan H. Rodger , Anna O. Bilska , Kenneth H. Leider , Magdalena Procopiuc , Octavian Procopiuc, Jason R. Salemme , Edwin Tsang : A collection of tools for making automata theory and formal languages come alive. SIGCSE 1997 : 15-19 Cecilia Magdalena Ionescu , Octavian Procopiuc: Bounded Communication in Parallel Communicating Grammar Systems. Elektronische Informationsverarbeitung und Kybernetik 30 (2): 97-110 (1994) Ferucio Laurentiu Tiplea , Cristian Ene , Cecilia Magdalena Ionescu , Octavian Procopiuc: Some Decision Problems for Parallel Communicating Grammar Systems. Theor. Comput. Sci. 134 (2): 365-385 (1994) 1 [ 7 ] [ 9 ] 2 [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] 3 [ 3 ] 4 [ 1 ] 5 [ 1 ] [ 2 ] 6 [ 3 ] 7 [ 3 ] 8 [ 4 ] [ 5 ] [ 6 ] 9 [ 3 ] 10 [ 3 ] 11 [ 4 ] [ 5 ] [ 6 ] 12 [ 1 ] 13 [ 3 ] 14 [ 6 ] 15 [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] ![]() ©2005 Association for Computing Machinery |