The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stephan Olariu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dharmavani Bhagavathi, W. M. Denny, C. E. Grosch, Peter J. Looges, Stephan Olariu
    Sorting and merging on the DAP. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference, 1992, pp:93-99 [Conf]
  2. Dharmavani Bhagavathi, C. E. Grosch, Stephan Olariu
    A greedy hypercube-labeling algorithm. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference, 1992, pp:139-147 [Conf]
  3. Kennie H. Jones, Kenneth N. Lodding, Stephan Olariu, Larry Wilson, Chunsheng Xin
    Biomimetric Models for an Ecological Approach to Massively-Deployed Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2005, pp:322-327 [Conf]
  4. Kennie H. Jones, Kenneth N. Lodding, Stephan Olariu, Larry Wilson, Chunsheng Xin
    Biology-Inspired Distributed Consensus in Massively-Deployed Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2005, pp:99-112 [Conf]
  5. Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti
    Efficient Training of Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2006, pp:1-12 [Conf]
  6. Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Larry Wilson
    Time-optimal ranking algorithms on sorted matrices. [Citation Graph (0, 0)][DBLP]
    ASAP, 1995, pp:42-53 [Conf]
  7. Rong Lin, Stephan Olariu
    A simple array processor for binary prefix sums. [Citation Graph (0, 0)][DBLP]
    ASAP, 1995, pp:113-0 [Conf]
  8. Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
    Time-optimal Proximity Graph Computations on Enhanced Meshes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:119-124 [Conf]
  9. Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing
    Constant-Time Convexity Problems on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:169-180 [Conf]
  10. Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Efficient Image Computations on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1992, pp:589-594 [Conf]
  11. Rong Lin, Stephan Olariu
    Computing the Inner Product on Reconfigurable Buses with Shift Switching. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1992, pp:181-192 [Conf]
  12. Kurt Maly, Dennis E. Ray, J. Christian Wild, Irwin B. Levinstein, Stephan Olariu, C. Michael Overstreet, Nageswara S. V. Rao, Tijen Ireland, George Kantsios
    Computer Productivity Initiative. [Citation Graph (0, 0)][DBLP]
    CSEE, 1994, pp:441-459 [Conf]
  13. Kurt Maly, Dennis E. Ray, J. Christian Wild, Irwin B. Levinstein, Stephan Olariu, C. Michael Overstreet, Nageswara S. V. Rao, Deane Sibol, George Panayides
    Computer Productivity Initiative: Past, Present, Future. [Citation Graph (0, 0)][DBLP]
    CSEE, 1995, pp:15-29 [Conf]
  14. Koji Nakano, Stephan Olariu
    Energy-efficient randomized routing in radio networks. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2000, pp:35-44 [Conf]
  15. Beverly Jamison, Stephan Olariu
    A Linear-Time Recognition Algorithm for P4-Reducible Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1989, pp:1-19 [Conf]
  16. Rong Lin, Stephan Olariu
    Fast Parallel Algorithms for Cographs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:176-189 [Conf]
  17. Michael A. Langston, Stephan Olariu, James L. Schwing
    Parallel and Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    HICSS (1), 1997, pp:171- [Conf]
  18. Stephan Olariu, Andreas Kassler
    Minitrack: Quality of Service in Mobile and Wireless Networks. [Citation Graph (0, 0)][DBLP]
    HICSS, 2005, pp:- [Conf]
  19. Stephan Olariu, Ivan Stojmenovic
    Mobile Computing and Wireless Networks - Introduction. [Citation Graph (0, 0)][DBLP]
    HICSS, 2000, pp:- [Conf]
  20. Stephan Olariu, James L. Schwing
    Parallel Algorithms: Introduction. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1994, pp:117-119 [Conf]
  21. Stephan Olariu, Petia Todorova
    Quality of Service in Mobile and Wireless Networks: Minitrack Introduction. [Citation Graph (0, 0)][DBLP]
    HICSS, 2004, pp:- [Conf]
  22. Petia Todorova, Stephan Olariu, Hoang Nam Nguyen
    A Two-Cell-Lookahead Call Admission and Handoff Management Scheme for Multimedia LEO Satellite Networks. [Citation Graph (0, 0)][DBLP]
    HICSS, 2003, pp:302- [Conf]
  23. Albert Y. Zomaya, Matthew Clements, Stephan Olariu
    Randomized Reinforcement Based Scheduling In Parallel Processor Systems. [Citation Graph (0, 0)][DBLP]
    HICSS (1), 1997, pp:556-565 [Conf]
  24. Jeffrey V. Nickerson, Stephan Olariu
    Courier Assignment in Social Networks. [Citation Graph (0, 0)][DBLP]
    HICSS, 2007, pp:46- [Conf]
  25. Jeffrey V. Nickerson, Stephan Olariu
    Protecting with Sensor Networks: Attention and Response. [Citation Graph (0, 0)][DBLP]
    HICSS, 2007, pp:294- [Conf]
  26. Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng
    An Optimal Hardware-Algorithm for Selection Using a Fixed-Size Parallel Classifier Device. [Citation Graph (0, 0)][DBLP]
    HiPC, 1999, pp:284-288 [Conf]
  27. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:292-302 [Conf]
  28. Stephan Olariu, C. Michael Overstreet, Zhaofang Wen
    An Optimal Parallel Algorithm to Reconstruct a Binary Tree from its Traversals. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:484-495 [Conf]
  29. Stephan Olariu, W. Shen, Larry Wilson
    Sub-Logarithmic Algorithms for the Largest Empty Rectangle Problem. [Citation Graph (0, 0)][DBLP]
    ICCI, 1992, pp:106-109 [Conf]
  30. Rong Lin, Stephan Olariu
    A Simple Optimal Parallel Algorithm to Solve the Lowest Common Ancestor Problem. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:455-461 [Conf]
  31. Ashraf Wadaa, Stephan Olariu, Larry Wilson, Mohamed Eltoweissy
    Scalable Cryptographic Key Management in Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ICDCS Workshops, 2004, pp:796-802 [Conf]
  32. Stephan Olariu, Kurt Maly, Edwin C. Foudriat, Sameh M. Yamany
    Wireless Support for Telemedicine in Disaster Management. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2004, pp:649-656 [Conf]
  33. Ashraf Wadaa, Stephan Olariu, Larry Wilson, Mohamed Eltoweissy, K. Jones
    On Providing Anonymity in Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ICPADS, 2004, pp:411-418 [Conf]
  34. Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Rong Lin, Stephan Olariu, James L. Schwing, W. Shen, Larry Wilson
    Time-Optimal Multiple Rank Computations on Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1994, pp:35-38 [Conf]
  35. Dharmavani Bhagavathi, Himabindu Gurla, Stephan Olariu, Rong Lin, James L. Schwing, Jingyuan Zhang
    Square Meshes Are Not Optimal For Convex Hull Computation. [Citation Graph (0, 0)][DBLP]
    ICPP, 1993, pp:307-310 [Conf]
  36. Dharmavani Bhagavathi, Himabindu Gurla, Stephan Olariu, James L. Schwing, W. Shen, Larry Wilson, Jingyuan Zhang
    Time- and VLSI-Optimal Sorting on Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    ICPP, 1993, pp:192-195 [Conf]
  37. Dharmavani Bhagavathi, Peter J. Looges, Stephan Olariu, James L. Schwing, Jingyuan Zhang
    A Fast Selection Algorithm for Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1992, pp:10-17 [Conf]
  38. Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing
    Constant Time Convexity Problems on Dense Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1994, pp:210-213 [Conf]
  39. Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing
    Antipodality-Based Time-Optimal Computation on Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1995, pp:17-20 [Conf]
  40. Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Larry Wilson
    A Framework for Solving Geometric Problems on Enhanced Meshes. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1995, pp:172-175 [Conf]
  41. Rong Lin, Stephan Olariu
    A Fast Parallel Algorithm to Compute Path Functions for Cographs. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1991, pp:263-266 [Conf]
  42. Koji Nakano, Stephan Olariu
    Energy-Efficient Initialization Protocols for Radio Networks with No Collision Detection. [Citation Graph (0, 0)][DBLP]
    ICPP, 2000, pp:263-270 [Conf]
  43. Koji Nakano, Stephan Olariu
    Uniform Leader Election Protocols in Radio Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 2001, pp:240-250 [Conf]
  44. Koji Nakano, Stephan Olariu
    An Efficient Algorithm for Row Minima Computations in Monotone Matrices. [Citation Graph (0, 0)][DBLP]
    ICPP, Vol. 2, 1996, pp:54-61 [Conf]
  45. Koji Nakano, Stephan Olariu, Albert Y. Zomaya
    Energy-Efficient Deterministic Routing Protocols in Radio Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 2000, pp:181-188 [Conf]
  46. Stephan Olariu, Rajendra Shirhatti, Albert Y. Zomaya
    OSCAR - An Opportunistic Call Admission Protocol for LEO Satellite Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 2004, pp:548-555 [Conf]
  47. Stephan Olariu, Albert Y. Zomaya
    A Time- and Cost-Optimal Algorithm for Overlap Graphs, with Applications. [Citation Graph (0, 0)][DBLP]
    ICPP, Vol. 2, 1996, pp:74-81 [Conf]
  48. Nageswara S. V. Rao, Kurt Maly, Stephan Olariu, Liping Zhang, David Game
    Average Waiting Time Profiles of DQDB. [Citation Graph (0, 0)][DBLP]
    ICPP (2), 1991, pp:278-279 [Conf]
  49. Stephan Olariu, Ivan Stojmenovic
    Message from the Chairs. [Citation Graph (0, 0)][DBLP]
    ICPP Workshops, 2000, pp:501-0 [Conf]
  50. Nageswara S. V. Rao, Kurt Maly, Stephan Olariu, Sudheer Dharanikota, Liping Zhang, David Game
    Average Waiting Time Profiles of Uniform DQDB Model. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1994, pp:1326-1333 [Conf]
  51. Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Ivan Stojmenovic, Jingyuan Zhang
    Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:110-114 [Conf]
  52. Denis Gracanin, Mohamed Eltoweissy, Stephan Olariu, Ashraf Wadaa
    On Modeling Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  53. Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Work-Time Optimal K-Merge Algorithms on the PRAM. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:298-0 [Conf]
  54. Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    An O((log log n)2) Time Convex Hull Algorithm on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:439-446 [Conf]
  55. Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Randomized Initialization Protocols for Packet Radio Networks. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:544-0 [Conf]
  56. Oscar H. Ibarra, Koji Nakano, Stephan Olariu
    Workshop on Advances in Parallel and Distributed Computational Models. [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:101- [Conf]
  57. Oscar H. Ibarra, Stephan Olariu, Koji Nakano, Jie Wu
    Workshop Introduction. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  58. Rong Lin, Koji Nakano, Stephan Olariu, Maria Cristina Pinotti, James L. Schwing, Albert Y. Zomaya
    A Scalable VLSI Architecture for Binary Prefix Sums. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:333-337 [Conf]
  59. Rong Lin, Koji Nakano, Stephan Olariu, Maria Cristina Pinotti, James L. Schwing, Albert Y. Zomaya
    Scalable Hardware-Algorithms for Binary Prefix Sums. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP Workshops, 1999, pp:634-642 [Conf]
  60. Rong Lin, Koji Nakano, Stephan Olariu, Albert Y. Zomaya
    An Efficient VLSI Architecture Parallel Prefix Counting With Domino Logic. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:273-0 [Conf]
  61. Koji Nakano, Stephan Olariu
    An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable. [Citation Graph (0, 0)][DBLP]
    IPPS, 1996, pp:687-691 [Conf]
  62. Koji Nakano, Stephan Olariu, James L. Schwing
    Broadcast-Efficient Algorithms on the Coarse-Grain Broadcast Communication Model with Few Channels. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:31-35 [Conf]
  63. Koji Nakano, Stephan Olariu, Albert Y. Zomaya
    A Time-Optimal Solution for the Path Cover Problem on Cographs. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:26-30 [Conf]
  64. Stephan Olariu, Ivan Stojmenovic
    Time-Optimal Proximity Algorithms on Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:94-101 [Conf]
  65. Stephan Olariu, James L. Schwing
    A faster sorting algorithm in the broadcast communication model. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:319-323 [Conf]
  66. Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Fast Computer Vision Algorithms for Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:258-261 [Conf]
  67. Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
    On the Dynamic Initialization of Parallel Computers. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:679-0 [Conf]
  68. Stephan Olariu, Qingwen Xu
    Information Assurance In Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  69. Jie Wu, Stephan Olariu
    On Cost-Optimal Merge of Two Intransitive Sorted Sequences. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  70. Ashraf Wadaa, Stephan Olariu, Larry Wilson, K. Jones, Qingwen Xu
    On Training a Sensor Network. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:220- [Conf]
  71. Albert Y. Zomaya, Fikret Erçal, Stephan Olariu
    Workshop on Bio-Inspired Solutions to Parallel Processing Problems (BioSP3). [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:568-569 [Conf]
  72. Albert Y. Zomaya, Fikret Erçal, Stephan Olariu
    Workshop Introduction. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  73. Jacir Luiz Bordim, JiangTao Cui, Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:215-224 [Conf]
  74. Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Efficient List Ranking on the Reconfigurable Mesh, with Applications. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:326-335 [Conf]
  75. Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Weighted and Unweighted Selection Algorithms for k Sorted Sequences. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:52-61 [Conf]
  76. Koji Nakano, Stephan Olariu
    Randomized Leader Election Protocols in Radio Networks with No Collision Detection. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:362-373 [Conf]
  77. Koji Nakano, Stephan Olariu
    Randomized O (log log n)-Round Leader Election Protocols in Packet Radio Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:209-218 [Conf]
  78. Kennie H. Jones, Kenneth N. Lodding, Stephan Olariu, Larry Wilson, Chunsheng Xin
    Energy Usage in Biomimetic Models for Massively-Deployed Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ISPA Workshops, 2005, pp:434-443 [Conf]
  79. Venkatavasu Bokka, Stephan Olariu, James L. Schwing, Larry Wilson, Albert Y. Zomaya
    A time-optimal solution to planar point location in ordered functional domains, with applications. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1996, pp:447-453 [Conf]
  80. Koji Nakano, Stephan Olariu
    A Survey on Leader Election Protocols for Radio Networks. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:71-0 [Conf]
  81. Biing-Feng Wang, Stephan Olariu
    On the Power of the Mesh with Hybrid Buses. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1997, pp:172-178 [Conf]
  82. K. Jones, Ashraf Wadaa, Stephan Olariu, Larry Wilson, Mohamed Eltoweissy
    Towards a new paradigm for securing wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    NSPW, 2003, pp:115-121 [Conf]
  83. Dharmavani Bhagavathi, Stephan Olariu, W. Shen, Larry Wilson
    A Unifying Look at Semigroup Computations on Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    PARLE, 1993, pp:561-569 [Conf]
  84. Stephan Olariu, Ivan Stojmenovic
    Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes. [Citation Graph (0, 0)][DBLP]
    PARLE, 1994, pp:134-145 [Conf]
  85. Kshirasagar Naik, David S. L. Wei, Stephan Olariu
    Channel assignment in cellular networks with synchronous base stations. [Citation Graph (0, 0)][DBLP]
    PE-WASUN, 2005, pp:222-229 [Conf]
  86. Stephan Olariu, Qingwen Xu, Ivan Stojmenovic
    Evaluating Routing-Related Energy Expenditure in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    PerCom Workshops, 2005, pp:357-361 [Conf]
  87. Ihn-Han Bae, Sun-Jin Oh, Stephan Olariu
    A Fuzzy Logic-Based Location Management Method for Mobile Networks. [Citation Graph (0, 0)][DBLP]
    SERA, 2003, pp:304-319 [Conf]
  88. Koji Nakano, Stephan Olariu
    A randomized leader election protocol for ad-hoc networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:253-267 [Conf]
  89. Mona El-Kadi, Stephan Olariu, Hussein M. Abdel-Wahab
    A QoS Provisioning Scheme for Multimedia Wireless Networks. [Citation Graph (0, 0)][DBLP]
    SMARTNET, 2000, pp:237-252 [Conf]
  90. Edwin C. Foudriat, Kurt Maly, Stephan Olariu
    H3M - A Rapidly Deployable Architecture with QoS Provisioning for Wireless Networks. [Citation Graph (0, 0)][DBLP]
    SMARTNET, 2000, pp:283-306 [Conf]
  91. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:175-180 [Conf]
  92. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    LBFS Orderings and Cocomparability Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:883-884 [Conf]
  93. Rong Lin, Stephan Olariu
    On the parallel recognition of some tree-representable graphs. [Citation Graph (0, 0)][DBLP]
    SPDP, 1990, pp:6-13 [Conf]
  94. Dharmavani Bhagavathi, Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Time- and Cost-Optimal Parallel Algorithms for the Dominance and Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1994, pp:49-52 [Conf]
  95. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:358-368 [Conf]
  96. Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Optimal Parallel Algorithms for Finding Proximate Points, with Applications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:224-233 [Conf]
  97. Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing
    Time-Optimal Tree Computations on Sparse Meshes. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:193-205 [Conf]
  98. Luitpold Babel, Stephan Olariu
    On the Isomorphism of Graphs with Few P4s. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:24-36 [Conf]
  99. Luitpold Babel, Stephan Olariu
    A New Characterization of P4-connected Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:17-30 [Conf]
  100. Luitpold Babel, Stephan Olariu
    On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:25-37 [Conf]
  101. Luitpold Babel, Stephan Olariu
    Domination and Steiner Tree Problems on Graphs with Few P4S. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:337-350 [Conf]
  102. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:211-224 [Conf]
  103. Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu
    On Domination Elimination Orderings and Domination Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:81-92 [Conf]
  104. Beverly Jamison, Stephan Olariu
    On the Homogeneous Decomposition of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1992, pp:170-183 [Conf]
  105. Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart
    On Subfamilies of AT-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:241-253 [Conf]
  106. Mohamed Eltoweissy, Ashraf Wadaa, Stephan Olariu, Larry Wilson
    Group key management scheme for large-scale sensor networks. [Citation Graph (0, 0)][DBLP]
    Ad Hoc Networks, 2005, v:3, n:5, pp:668-688 [Journal]
  107. Dharmavani Bhagavathi, Peter J. Looges, Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Selection on Rectangular Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    BIT, 1993, v:33, n:1, pp:7-14 [Journal]
  108. Stephan Olariu, James L. Schwing, Jingyuan Zhang
    A Constant-Time Channel-Assignment Algorithm on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:4, pp:586-597 [Journal]
  109. Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Optimal Convex Hull Algorithms on Enhanced Meshes. [Citation Graph (0, 0)][DBLP]
    BIT, 1993, v:33, n:3, pp:396-410 [Journal]
  110. Selim G. Akl, Stephan Olariu, Ivan Stojmenovic
    A New BFS Parent Array Encoding of t-ary Trees. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2000, v:19, n:5, pp:- [Journal]
  111. Dharmavani Bhagavathi, C. E. Grosch, Stephan Olariu
    A Greedy Hypercube-Labeling Algorithm. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1994, v:37, n:2, pp:124-128 [Journal]
  112. Beverly Jamison, Stephan Olariu
    Indexing for Multi-Attribute Retrieval (Short Note). [Citation Graph (0, 0)][DBLP]
    Comput. J., 1992, v:35, n:5, pp:535-537 [Journal]
  113. Stephan Olariu, C. Michael Overstreet, Zhaofang Wen
    A Mergeable Double-Ended Priority Queue. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1991, v:34, n:5, pp:423-427 [Journal]
  114. Lan Wang, Stephan Olariu
    Cluster Maintenance in Mobile Ad-hoc Networks. [Citation Graph (0, 0)][DBLP]
    Cluster Computing, 2005, v:8, n:2-3, pp:111-118 [Journal]
  115. Albert Y. Zomaya, Daniel Patterson, Stephan Olariu
    Sequential and Parallel Meta-Heuristics for Solving the Single Row Routing Problem. [Citation Graph (0, 0)][DBLP]
    Cluster Computing, 2004, v:7, n:2, pp:123-139 [Journal]
  116. Stephan Olariu, Qingwen Xu
    A simple and robust virtual infrastructure for massively deployed wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 2005, v:28, n:13, pp:1505-1516 [Journal]
  117. Tom Pfeifer, Stephan Olariu, Alois Ferscha
    Special issue on wireless sensor networks and applications. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 2005, v:28, n:13, pp:1481-1483 [Journal]
  118. Kurt Maly, Stephan Olariu, Liping Zhang, Nageswara S. V. Rao
    Fairness in DQDB revisited: a new solution. [Citation Graph (0, 0)][DBLP]
    Comput. Syst. Sci. Eng., 2003, v:18, n:2, pp:63-70 [Journal]
  119. Luitpold Babel, Stephan Olariu
    On the Structure of Graphs with Few P4s. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:1-13 [Journal]
  120. Luitpold Babel, Stephan Olariu
    On the p-connectedness of Graphs - A Survey. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:11-33 [Journal]
  121. Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing
    Time-optimal Tree Computations on Sparse Meshes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:77, n:3, pp:201-220 [Journal]
  122. Bruno Courcelle, Stephan Olariu
    Upper bounds to the clique width of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:77-114 [Journal]
  123. Beverly Jamison, Stephan Olariu
    Linear Time optimization Algorithms for P4-sparse Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:61, n:2, pp:155-175 [Journal]
  124. Rong Lin, Stephan Olariu
    A Fast Parallel Algorithm to Recognize P4-sparse Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:191-215 [Journal]
  125. Stephan Olariu, Maria Cristina Pinotti, Larry Wilson
    Greedy algorithms for tracking mobile users in special mobility graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:121, n:1-3, pp:215-227 [Journal]
  126. Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu
    Efficient algorithms for graphs with few P4's. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:29-51 [Journal]
  127. Jie Wu, Stephan Olariu
    On Cost-Optimal Merge of Two Intransitive Sorted Sequences. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:1, pp:99-106 [Journal]
  128. Koji Nakano, Stephan Olariu
    Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:2, pp:123-126 [Journal]
  129. Stephan Olariu, Iain A. Stewart
    A New Characterization of Unbreakable Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:3, pp:193-196 [Journal]
  130. Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Optimal Parallel Encoding and Decoding Algorithms for Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1992, v:3, n:1, pp:1-10 [Journal]
  131. Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Ivan Stojmenovic
    Time-Optimal Digital Geometry Algorithms on Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    IJPRAI, 1995, v:9, n:4, pp:601-613 [Journal]
  132. Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing
    Time- and VLSI-Optimal Convex Hull Computation on Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:5, pp:273-280 [Journal]
  133. Derek G. Corneil, Hiryoung Kim, Sridhar Natarajan, Stephan Olariu, Alan P. Sprague
    Simple Linear Time Recognition of Unit Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:2, pp:99-104 [Journal]
  134. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:5, pp:253-257 [Journal]
  135. Rong Lin, Stephan Olariu
    A Fast Parallel, Algorithm to Recognize, Partitionable Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:3, pp:153-157 [Journal]
  136. Stephan Olariu
    Paw-Fee Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:1, pp:53-54 [Journal]
  137. Stephan Olariu
    On the Unimodality of Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:6, pp:289-292 [Journal]
  138. Stephan Olariu
    A Simple Linear-Time Algorithm for Computing the RNG and MST of Unimodal Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:5, pp:243-247 [Journal]
  139. Stephan Olariu
    A Generalization of Chvátal's Star-Cutset Lemma. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:33, n:6, pp:301-303 [Journal]
  140. Stephan Olariu
    On the Closure of Triangle-Free Graphs Under Substitution. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:2, pp:97-101 [Journal]
  141. Stephan Olariu
    An Optimal Greedy Heuristic to Color Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:1, pp:21-25 [Journal]
  142. Stephan Olariu, J. Randall
    Welsh-Powell Opposition Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:1, pp:43-46 [Journal]
  143. Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Fast computer vision algorithms for reconfigurable meshes. [Citation Graph (0, 0)][DBLP]
    Image Vision Comput., 1992, v:10, n:9, pp:610-616 [Journal]
  144. Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Fast component labelling and convex hull computation on reconfigurable meshes. [Citation Graph (0, 0)][DBLP]
    Image Vision Comput., 1993, v:11, n:7, pp:447-455 [Journal]
  145. Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Computing the Hough transform on reconfigurable meshes. [Citation Graph (0, 0)][DBLP]
    Image Vision Comput., 1993, v:11, n:10, pp:623-628 [Journal]
  146. Stephan Olariu, S. Toida, M. Zubair
    On a Conjecture by Plaisted and Hong. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1988, v:9, n:4, pp:597-598 [Journal]
  147. Henry Meyniel, Stephan Olariu
    A new conjecture about minimal imperfect graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:2, pp:244-247 [Journal]
  148. Stephan Olariu
    All variations on perfectly orderable graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:2, pp:150-159 [Journal]
  149. Stephan Olariu
    No antitwins in minimal imperfect graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:2, pp:255-257 [Journal]
  150. Stephan Olariu
    The Strong Perfect Graph Conjecture for pan-free graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:2, pp:187-191 [Journal]
  151. Mohamed F. Younis, Waleed Youssef, Mohamed Eltoweissy, Stephan Olariu
    Safe Quality of Service Aware Management of Heterogeneous Sensor Networks. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2006, v:7, n:1, pp:179-193 [Journal]
  152. Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing
    Constant-Time Convexity Problems on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:27, n:1, pp:86-99 [Journal]
  153. Dharmavani Bhagavathi, Stephan Olariu, James L. Schwing, W. Shen, Larry Wilson, Jingyuan Zhang
    Convexity Problems on Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:27, n:2, pp:142-156 [Journal]
  154. Dharmavani Bhagavathi, Stephan Olariu, W. Shen, Larry Wilson
    A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:22, n:1, pp:113-120 [Journal]
  155. Stuart Campbell, Mohan Kumar, Stephan Olariu
    The hierarchical cliques interconnection network. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:1, pp:16-28 [Journal]
  156. Gen-Huey Chen, Stephan Olariu, James L. Schwing, Biing-Feng Wang, Jingyuan Zhang
    Constant-Time Tree algorithms on Reconfigurable Meshes on Size n x n. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:26, n:2, pp:137-150 [Journal]
  157. Sajal K. Das, Stephan Olariu, Sushil K. Prasad
    Special Issue on Parallel and Distributed Data Structures: Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:49, n:1, pp:1-3 [Journal]
  158. Rong Lin, Stephan Olariu
    An NC Recognition Algorithm for Cographs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:13, n:1, pp:76-90 [Journal]
  159. Rong Lin, Stephan Olariu
    An Optimal Parallel Matching Algorithm for Cographs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:22, n:1, pp:26-36 [Journal]
  160. Stephan Olariu
    Preface: Special Issue on Wireless Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:7, pp:853-854 [Journal]
  161. Stephan Olariu, C. Michael Overstreet, Zhaofang Wen
    Reconstructing a Binary Tree from its Traversals in Doubly. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:27, n:1, pp:100-105 [Journal]
  162. Stephan Olariu, James L. Schwing
    A Novel Deterministic Sampling Scheme with Applications to Broadcast-Efficient Sorting on the Reconfigurable Mesh. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:32, n:2, pp:215-222 [Journal]
  163. Stephan Olariu, Ivan Stojmenovic
    Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:36, n:2, pp:144-155 [Journal]
  164. Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
    Time-Optimal Proximity Graph Computations on Enhanced Meshes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:49, n:2, pp:204-217 [Journal]
  165. Stephan Olariu, Jie Wu
    Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:9, pp:1145-1147 [Journal]
  166. Albert Y. Zomaya, Michael Haydock, Stephan Olariu
    Some observations on using meta-heuristics for efficient location management in mobile computing networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2003, v:63, n:1, pp:33-44 [Journal]
  167. Albert Y. Zomaya, Stephan Olariu
    Problems in Parallel and Distributed Computing: Solutions Based on Evolutionary Paradigms. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2002, v:62, n:9, pp:1335-1337 [Journal]
  168. Albert Y. Zomaya, Stephan Olariu
    Special Issue on Parallel Evolutionary Computing: Guest Editor's Introduction. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1997, v:47, n:1, pp:1-7 [Journal]
  169. Albert Y. Zomaya, Adrian Yates, Stephan Olariu
    Fault-Tolerant Recursive Least-Squares Computations on a Mesh-Connected Parallel Processor. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2002, v:62, n:7, pp:1142-1167 [Journal]
  170. Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti
    Special issue: Algorithms for wireless and ad-hoc networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:4, pp:487-488 [Journal]
  171. Stephan Olariu, Mohamed Eltoweissy, Mohamed Younis
    ANSWER: AutoNomouS netWorked sEnsoR system. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:1, pp:111-124 [Journal]
  172. Ruzana Ishak, Shaharuddin Salleh, Stephan Olariu, Mohd. Ismail Abdul Aziz
    SPLAI: Computational finite element model for sensor networks. [Citation Graph (0, 0)][DBLP]
    Mobile Information Systems, 2006, v:2, n:1, pp:77-92 [Journal]
  173. Ashraf Wadaa, Stephan Olariu, Larry Wilson, Mohamed Eltoweissy, K. Jones
    Training a Wireless Sensor Network. [Citation Graph (0, 0)][DBLP]
    MONET, 2005, v:10, n:1-2, pp:151-168 [Journal]
  174. Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Efficient List Ranking on the Reconfigurable Mesh with Applications. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:5, pp:593-611 [Journal]
  175. Stephan Olariu, Ashraf Wadaa, Larry Wilson, Mohamed Eltoweissy
    Wireless sensor networks: leveraging the virtual infrastructure. [Citation Graph (0, 0)][DBLP]
    IEEE Network, 2004, v:18, n:4, pp:51-56 [Journal]
  176. Rong Lin, Stephan Olariu
    A fast cost-optimal parallel algorithm for the lowest common ancestor problem. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1992, v:18, n:5, pp:511-516 [Journal]
  177. Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Applications of Reconfigurable Meshes to Constant-Time Computations. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1993, v:19, n:2, pp:229-237 [Journal]
  178. Stephan Olariu, Zhaofang Wen
    An efficient parallel algorithm for multiselection. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1991, v:17, n:6-7, pp:689-693 [Journal]
  179. Stephan Olariu, Zhaofang Wen, Wei Xiong Zhang
    A faster optimal algorithm for the measure problem. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1991, v:17, n:6-7, pp:683-687 [Journal]
  180. Dharmavani Bhagavathi, Stephan Olariu, W. Shen, Larry Wilson
    A Unifying Look at Semigroup Computations on Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1994, v:4, n:, pp:73-82 [Journal]
  181. Dharmavani Bhagavathi, Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Convex Polygon Problems on Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:249-256 [Journal]
  182. Peter J. Looges, Stephan Olariu
    A Practical Platform for Crew Emulation. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:139-145 [Journal]
  183. Rong Lin, Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Simulating Enhanced Meshes, with Applications. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:59-70 [Journal]
  184. Rong Lin, Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Computing on Reconfigurable Buses - A New Computational Paradigm. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1994, v:4, n:, pp:465-476 [Journal]
  185. Stephan Olariu, Wenhui Shen, Larry Wilson
    Sub-Logarithmic Algorithms for the Largest Empty Rectangle Problem. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:79-85 [Journal]
  186. Stephan Olariu, James L. Schwing, Jingyuan Zhang
    On the Power of Two-Dimensional Processor Arrays with Reconfigurable Bus Systems. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1991, v:1, n:, pp:29-34 [Journal]
  187. Stephan Olariu, Zhaofang Wen
    A Parallel Algorithm for Forest Reconstruction. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:157-160 [Journal]
  188. Venkatavasu Bokka, Stephan Olariu, James L. Schwing, Larry Wilson, Albert Y. Zomaya
    A time-optimal solution to a classification problem in ordered functional domains, with applications. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1997, v:30, n:9, pp:1555-1564 [Journal]
  189. Stephan Olariu, Nageswara S. V. Rao
    Simple algorithms for some classification problems. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1996, v:17, n:2, pp:163-167 [Journal]
  190. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1284-1297 [Journal]
  191. Beverly Jamison, Stephan Olariu
    Recognizing P_4 Sparse Graphs in Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:381-406 [Journal]
  192. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    Asteroidal Triple-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:3, pp:399-430 [Journal]
  193. Beverly Jamison, Stephan Olariu
    P-Components and the Homogeneous Decomposition of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:3, pp:448-463 [Journal]
  194. Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng
    An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2000, v:49, n:12, pp:1310-1324 [Journal]
  195. Beverly Jamison, Stephan Olariu
    A Linear-Time Recognition Algorithm for P4-Reducible Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:145, n:1&2, pp:329-344 [Journal]
  196. Koji Nakano, Stephan Olariu, Albert Y. Zomaya
    A time-optimal solution for the path cover problem on cographs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1541-1556 [Journal]
  197. Vassilis Giakoumakis, Stephan Olariu
    All minimal prime extensions of hereditary classes of graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:370, n:1-3, pp:74-93 [Journal]
  198. Stephan Olariu, Syed Rashid Ali Rizvi, Rajendra Shirhatti, Petia Todorova
    Q-Win - A New Admission and Handoff Management Scheme for Multimedia LEO Satellite Networks. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2003, v:22, n:1-4, pp:151-168 [Journal]
  199. Stephan Olariu, Ivan Stojmenovic
    Foreword. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2003, v:22, n:1-4, pp:9- [Journal]
  200. Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
    On the Dynamic Initialization of Parallel Computers. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2000, v:15, n:1, pp:5-24 [Journal]
  201. Shaharuddin Salleh, Bahrom Sanugi, Hishamuddin Jamaluddin, Stephan Olariu, Albert Y. Zomaya
    Enhanced Simulated Annealing Technique for the Single-Row Routing Problem. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2002, v:21, n:3, pp:285-302 [Journal]
  202. Shaharuddin Salleh, Stephan Olariu, Albert Y. Zomaya, Kiew Leh Yieng, Nur Arina B. Aziz
    Single-row mapping and transformation of connected graphs. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2007, v:39, n:1, pp:73-89 [Journal]
  203. Alan A. Bertossi, Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng
    Classifying Matrices Separating Rows and Columns. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2004, v:15, n:7, pp:654-665 [Journal]
  204. Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Ivan Stojmenovic, Jingyuan Zhang
    Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:7, pp:687-703 [Journal]
  205. Dharmavani Bhagavathi, Himabindu Gurla, Stephan Olariu, James L. Schwing, Larry Wilson, Jingyuan Zhang
    Time- and VLSI-Optimal Sorting on Enhanced Meshes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:10, pp:929-937 [Journal]
  206. Dharmavani Bhagavathi, Himabindu Gurla, Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Square Meshes Are Not Optimal for Convex Hull Computation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:6, pp:545-554 [Journal]
  207. Dharmavani Bhagavathi, Peter J. Looges, Stephan Olariu, James L. Schwing, Jingyuan Zhang
    A Fast Selection Algorithm for Meshes with Multiple Broadcasting. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1994, v:5, n:7, pp:772-778 [Journal]
  208. Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing
    Podality-Based Time-Optimal Computations on Enhanced Meshes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:10, pp:1019-1035 [Journal]
  209. Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing
    Constant-Time Algorithms for Constrained Triangulations on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:11, pp:1057-1072 [Journal]
  210. Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Larry Wilson
    Time-Optimal Domain-Specific Querying on Enhanced Meshes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:1, pp:13-24 [Journal]
  211. Venkatavasu Bokka, Koji Nakano, Stephan Olariu, James L. Schwing, Larry Wilson
    Optimal Algorithms for the Multiple Query Problem on Reconfigurable Meshes, with Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2001, v:12, n:9, pp:875-887 [Journal]
  212. Tiziana Calamoneri, Stephan Olariu, Rossella Petreschi
    A Simple Parallel Algorithm to Draw Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:10, pp:1009-1018 [Journal]
  213. Mona El-Kadi, Stephan Olariu, Hussein M. Abdel-Wahab
    A Rate-Based Borrowing Scheme for QoS Provisioning in Multimedia Wireless Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2002, v:13, n:2, pp:156-166 [Journal]
  214. Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Optimal Parallel Algorithms for Finding Proximate Points, with Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:12, pp:1153-1166 [Journal]
  215. Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    An O((log log n)2) Time Algorithm to Compute the Convex Hull of Sorted Points on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:12, pp:1167-1179 [Journal]
  216. Tatsuya Hayashi, Koji Nakano, Stephan Olariu
    Work-Time Optimal k-Merge Algorithms on the PRAM. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:3, pp:275-282 [Journal]
  217. Rong Lin, Koji Nakano, Stephan Olariu, Albert Y. Zomaya
    An Efficient Parallel Prefix Sums Architecture with Domino Logic. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2003, v:14, n:9, pp:922-931 [Journal]
  218. Rong Lin, Stephan Olariu
    Reconfigurable Buses with Shift Switching: Concepts and Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:1, pp:93-102 [Journal]
  219. Rong Lin, Stephan Olariu, James L. Schwing, Biing-Feng Wang
    The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:3, pp:266-280 [Journal]
  220. Anjlica Malla, Mona El-Kadi, Stephan Olariu, Petia Todorova
    A Fair Resource Allocation Protocol for Multimedia Wireless Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2003, v:14, n:1, pp:63-71 [Journal]
  221. Rong Lin, Koji Nakano, Stephan Olariu, Maria Cristina Pinotti, James L. Schwing, Albert Y. Zomaya
    Scalable Hardware-Algorithms for Binary Prefix Sums. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:8, pp:838-850 [Journal]
  222. Stephan Olariu, Maria Cristina Pinotti, Si-Qing Zheng
    How to Sort N Items Using a Sorting Network of Fixed I/O Size. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:5, pp:487-499 [Journal]
  223. Stephan Olariu, James L. Schwing, Jingyuan Zhang
    Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1992, v:3, n:3, pp:364-374 [Journal]
  224. Stephan Olariu, Zhaofang Wen
    Optimal Parallel Initialization Algorithms for a Class of Priority Queues. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1991, v:2, n:4, pp:423-429 [Journal]
  225. Stephan Olariu, Albert Y. Zomaya
    A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:10, pp:1009-1025 [Journal]
  226. Stephan Olariu, David Simplot-Ryl, Ivan Stojmenovic
    Localized Communication and Topology Protocols for Ad Hoc Networks: A Preface to the Special Section. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2006, v:17, n:4, pp:289-291 [Journal]
  227. Koji Nakano, Stephan Olariu
    Randomized Initialization Protocols for Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:7, pp:749-759 [Journal]
  228. Koji Nakano, Stephan Olariu
    Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:8, pp:851-863 [Journal]
  229. Koji Nakano, Stephan Olariu
    Uniform Leader Election Protocols for Radio Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2002, v:13, n:5, pp:516-526 [Journal]
  230. Koji Nakano, Stephan Olariu
    An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable Mesh, with Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:9, pp:983-990 [Journal]
  231. Koji Nakano, Stephan Olariu
    An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:6, pp:561-569 [Journal]
  232. Koji Nakano, Stephan Olariu, James L. Schwing
    Broadcast-Efficient Protocols for Mobile Radio Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:12, pp:1276-1289 [Journal]
  233. Koji Nakano, Stephan Olariu, Albert Y. Zomaya
    Energy-Efficient Permutation Routing in Radio Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2001, v:12, n:6, pp:544-557 [Journal]
  234. Koji Nakano, Stephan Olariu, Albert Y. Zomaya
    Energy-Efficient Routing in the Broadcast Communication Model. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2002, v:13, n:12, pp:1201-1210 [Journal]
  235. Stephan Olariu, David Simplot-Ryl, Ivan Stojmenovic
    Localized Communication and Topology Protocols for Ad Hoc Networks-Part II: A Preface to the Special Section. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2006, v:17, n:9, pp:897-898 [Journal]
  236. Stephan Olariu, Koji Nakano
    Guest Editors' Introduction to Special Section on Mobile Computing and Wireless Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2002, v:13, n:9, pp:865- [Journal]
  237. Nageswara S. V. Rao, Kurt Maly, Stephan Olariu, Sudheer Dharanikota, Liping Zhang, David Game
    Average Waiting Time Profiles of Uniform Distributed Queue Dual Bus System Model. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1995, v:6, n:10, pp:1068-1084 [Journal]
  238. Lan Wang, Stephan Olariu
    A Two-Zone Hybrid Routing Protocol for Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2004, v:15, n:12, pp:1105-1116 [Journal]
  239. Albert Y. Zomaya, Matthew Clements, Stephan Olariu
    A Framework for Reinforcement-Based Scheduling in Parallel Processor Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:3, pp:249-260 [Journal]
  240. Edwin C. Foudriat, Kurt Maly, Stephan Olariu, Petia Todorova
    Media access using dynamic bandwidth system to improve satellite network uplink performance. [Citation Graph (0, 0)][DBLP]
    Wireless Communications and Mobile Computing, 2003, v:3, n:2, pp:225-238 [Journal]
  241. Lan Wang, Stephan Olariu
    A unifying look at clustering in mobile ad hoc networks. [Citation Graph (0, 0)][DBLP]
    Wireless Communications and Mobile Computing, 2004, v:4, n:6, pp:623-637 [Journal]
  242. Stephan Olariu, Ivan Stojmenovic
    Design Guidelines for Maximizing Lifetime and Avoiding Energy Holes in Sensor Networks with Uniform Distribution and Uniform Reporting. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  243. Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi
    On the L(h, k)-Labeling of Co-comparability Graphs. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:116-127 [Conf]
  244. Chutima Boonthum, Irwin B. Levinstein, Stephan Olariu, E. Pigli, E. Shurkova, Albert Y. Zomaya
    Mobile computing: Opportunities for optimization research. [Citation Graph (0, 0)][DBLP]
    Computer Communications, 2007, v:30, n:4, pp:670-684 [Journal]
  245. Stephan Olariu
    Weak bipolarizable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:159-171 [Journal]
  246. Stephan Olariu
    Wings and perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:3, pp:281-296 [Journal]
  247. Pierre Duchet, Stephan Olariu
    Graphes parfaitement ordonnables généralises. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:90, n:1, pp:99-101 [Journal]
  248. Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann
    A charming class of perfectly orderable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:1, pp:67-74 [Journal]
  249. Stephan Olariu
    On sources in comparability graphs, with applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:110, n:1-3, pp:289-292 [Journal]
  250. Stephan Olariu
    Quasi-brittle graphs, a new class of perfectly orderable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:113, n:1-3, pp:143-153 [Journal]
  251. Albert Y. Zomaya, Fikret Erçal, Stephan Olariu
    Parallel computing problems and nature-inspired solutions. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 2001, v:17, n:4, pp:- [Journal]
  252. Albert Y. Zomaya, Fikret Erçal, Stephan Olariu
    Bio-inspired solutions to parallel processing problems. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 1998, v:14, n:5-6, pp:271-273 [Journal]
  253. Rong Lin, Stephan Olariu
    Efficient VLSI architectures for Columnsort. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. VLSI Syst., 1999, v:7, n:1, pp:135-138 [Journal]

  254. Asynchronous Training in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  255. 04122 Abstracts Collection -- Wireless Sensor Networks and Applications. [Citation Graph (, )][DBLP]


  256. A Lightweight Skeleton Construction Algorithm for Self-Organizing Sensor Networks. [Citation Graph (, )][DBLP]


  257. Safety and QoS-Aware Management of Heterogeneous Sensor Networks. [Citation Graph (, )][DBLP]


  258. Integrating Stability Estimation into Quality of Service Routing in Mobile Ad-hoc Networks. [Citation Graph (, )][DBLP]


  259. Multi-training sensor networks with bipartite conflict graphs. [Citation Graph (, )][DBLP]


  260. Providing VANET security through active position detection. [Citation Graph (, )][DBLP]


  261. Traffic-adaptive packet relaying in VANET. [Citation Graph (, )][DBLP]


  262. Asynchronous training in SANET. [Citation Graph (, )][DBLP]


  263. Efficient binary schemes for training heterogeneous sensor and actor networks. [Citation Graph (, )][DBLP]


  264. Common data security network (CDSN). [Citation Graph (, )][DBLP]


  265. Zipper: : a zero-infrastructure peer-to-peer system forvanet. [Citation Graph (, )][DBLP]


  266. ANSWER: autonomous wireless sensor network. [Citation Graph (, )][DBLP]


  267. Peer-to-peer multimedia content provisioning for vehicular ad hoc networks. [Citation Graph (, )][DBLP]


  268. NOTICE: an architecture for traffic incident detection. [Citation Graph (, )][DBLP]


  269. HexNet: Hexagon-Based Localization Technique For Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  270. Message from the Workshop Co-Organizers. [Citation Graph (, )][DBLP]


  271. An energy-efficient initialization algorithm for random radio networks. [Citation Graph (, )][DBLP]


  272. An optimal parallel matching algorithm for cographs. [Citation Graph (, )][DBLP]


  273. A Novel Approach to Reduce Traffic Chaos in Emergency and Evacuation Scenarios. [Citation Graph (, )][DBLP]


  274. NOTICE: An Architecture for the Notification of Traffic Incidents. [Citation Graph (, )][DBLP]


  275. A Secure and Privacy Aware Data Dissemination For The Notification of Traffic Incidents. [Citation Graph (, )][DBLP]


  276. Automatic Incident Detection In VANETs: A Bayesian Approach. [Citation Graph (, )][DBLP]


  277. Dynamic Adaptation of Joint Transmission Power and Contention Window in VANET. [Citation Graph (, )][DBLP]


  278. Enhancing Automatic Incident Detection Using Vehicular Communications. [Citation Graph (, )][DBLP]


  279. A Traffic Chaos Reduction Approach for Emergency Scenarios. [Citation Graph (, )][DBLP]


  280. Intelligent Highway Infrastructure for Planned Evacuations. [Citation Graph (, )][DBLP]


  281. Tiling-Based Localization Scheme for Sensor Networks Using a Single Beacon. [Citation Graph (, )][DBLP]


  282. Emergent Behavior in Massively-Deployed Sensor Networks. [Citation Graph (, )][DBLP]


  283. Sensor Networks Hype or Reality? [Citation Graph (, )][DBLP]


  284. A probabilistic routing protocol in VANET. [Citation Graph (, )][DBLP]


  285. An architecture for traffic incident detection. [Citation Graph (, )][DBLP]


  286. 2WIN: an efficient call admission control scheme for quality of service in broadband multimedia LEO satellite networks. [Citation Graph (, )][DBLP]


  287. A Weighted-Dissimilarity-Based Anomaly Detection Method for Mobile Wireless Networks. [Citation Graph (, )][DBLP]


  288. Acoustic Based 3D Localization and Sea-bed Modeling for Underwater Sensor Networks. [Citation Graph (, )][DBLP]


  289. Providing VANET security through active position detection. [Citation Graph (, )][DBLP]


  290. Utilizing the synchrony among base stations for better performance of channel assignment algorithms. [Citation Graph (, )][DBLP]


  291. Some aspects of the semi-perfect elimination. [Citation Graph (, )][DBLP]


  292. On a unique tree representation for P4-extendible graphs. [Citation Graph (, )][DBLP]


  293. A tree representation for P4-sparse graphs. [Citation Graph (, )][DBLP]


  294. A probabilistic model of integration. [Citation Graph (, )][DBLP]


Search in 1.008secs, Finished in 1.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002