The SCEAS System
| |||||||

## Search the dblp DataBase
Mohammad Ghodsi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Mohammad Ghodsi, Jörg-Rüdiger Sack
**A coarse grained parallel solution to terrain simplification.**[Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf] - Farshad Rostamabadi, Mohammad Ghodsi
**A fast algorithm for updating a labeling to avoid a moving point.**[Citation Graph (0, 0)][DBLP] CCCG, 2004, pp:204-208 [Conf] - Hossein Jowhari, Mohammad Ghodsi
**New Streaming Algorithms for Counting Triangles in Graphs.**[Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:710-716 [Conf] - Alireza Zarei, Mohammad Ghodsi
**Efficient computation of query point visibility in polygons with holes.**[Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 2005, pp:314-320 [Conf] - Mohammad Ghodsi, Oktie Hassanzadeh, Shahab Kamali, Morteza Monemizadeh
**A Hybrid Approach for Refreshing Web Page Repositories.**[Citation Graph (0, 0)][DBLP] DASFAA, 2005, pp:588-593 [Conf] - Alireza Mahdian, Hamid Khalili, Ehsan Nourbakhsh, Mohammad Ghodsi
**Web Graph Compression by Edge Elimination.**[Citation Graph (0, 0)][DBLP] DCC, 2006, pp:459- [Conf] - Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi
**SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:298-307 [Conf] - Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuheir Montazeri
**Computational Power of the Quantum Turing Automata.**[Citation Graph (0, 0)][DBLP] ITNG, 2007, pp:1077-1082 [Conf] - Mohammad Ghodsi, Krishna Kant
**Performance Analysis of Parallel Search Algorithms on Multiprocessors.**[Citation Graph (0, 0)][DBLP] Performance, 1990, pp:407-421 [Conf] - Hamid Nazerzadeh, Mohammad Ghodsi
**RAQ: A Range-Queriable Distributed Data Structure.**[Citation Graph (0, 0)][DBLP] SOFSEM, 2005, pp:269-277 [Conf] - Behdad Esfahbod, Mohammad Ghodsi, Ali Sharifi
**Common-Deadline Lazy Bureaucrat Scheduling Problems.**[Citation Graph (0, 0)][DBLP] WADS, 2003, pp:59-66 [Conf] - Mohammad Ali Abam, Mohammad Ghodsi
**An approximation algorithm for**[Citation Graph (0, 0)][DBLP]*d*_{1}-optimal motion of a rod robot with fixed rotations. Int. J. Comput. Math., 2006, v:83, n:3, pp:357-370 [Journal] - Ramtin Khosravi, Mohammad Ghodsi
**Shortest paths in simple polygons with polygon-meet constraints.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2004, v:91, n:4, pp:171-176 [Journal] - Arash Termehchy, Mohammad Ghodsi
**Pipelined operator tree scheduling in heterogeneous environments.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2003, v:63, n:6, pp:630-637 [Journal] - Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni
**Length-constrained path-matchings in graphs.**[Citation Graph (0, 0)][DBLP] Networks, 2002, v:39, n:4, pp:210-215 [Journal] - Mohammad Ghodsi, Krishna Kant
**Performance Analysis of Parallel Search Algorithms on Multiprocessor Systems.**[Citation Graph (0, 0)][DBLP] Perform. Eval., 1991, v:13, n:1, pp:67-81 [Journal] - Farshad Rostamabadi, Mohammad Ghodsi
**Label updating to avoid point-shaped obstacles in fixed model.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:369, n:1-3, pp:197-210 [Journal] - AmirAli Khosravi, Alireza Zarei, Mohammad Ghodsi
**Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon.**[Citation Graph (0, 0)][DBLP] CCCG, 2007, pp:249-252 [Conf] - Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi
**Weak Visibility of Two Objects in Planar Polygonal Scenes.**[Citation Graph (0, 0)][DBLP] ICCSA (1), 2007, pp:68-81 [Conf] - Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
**Scheduling to minimize gaps and power consumption.**[Citation Graph (0, 0)][DBLP] SPAA, 2007, pp:46-54 [Conf] - Seyed Iman Mirrezaei, Javad Shahparian, Mohammad Ghodsi
**RAQNet: A Topology-Aware Overlay Network.**[Citation Graph (0, 0)][DBLP] AIMS, 2007, pp:13-24 [Conf] - Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Shayan Oveis Gharan, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
**Spanning trees with minimum weighted degrees.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:104, n:3, pp:113-116 [Journal] - Ghassem Jaberipur, Behrooz Parhami, Mohammad Ghodsi
**An Efficient Universal Addition Scheme for All Hybrid-Redundant Representations with Weighted Bit-Set Encoding.**[Citation Graph (0, 0)][DBLP] VLSI Signal Processing, 2006, v:42, n:2, pp:149-158 [Journal] **Polar Diagram of Moving Objects.**[Citation Graph (, )][DBLP]**Visibility maintenance of a moving segment observer inside polygons with holes.**[Citation Graph (, )][DBLP]**The fastest way to view a query point in simple polygons.**[Citation Graph (, )][DBLP]**An efficient algorithm for label updating in 2PM model to avoid a moving object.**[Citation Graph (, )][DBLP]**Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs.**[Citation Graph (, )][DBLP]**Using Similarity Flooding for Extracting Similar Parts of Proteins.**[Citation Graph (, )][DBLP]**Permutation betting markets: singleton betting with extra information.**[Citation Graph (, )][DBLP]**Well-formed generalized task graphs.**[Citation Graph (, )][DBLP]**A Fast Community Based Algorithm for Generating Web Crawler Seeds Set.**[Citation Graph (, )][DBLP]**Space-Query-Time Tradeoff for Computing the Visibility Polygon.**[Citation Graph (, )][DBLP]**Visiting a Polygon on the Optimal Way to a Query Point.**[Citation Graph (, )][DBLP]**A topology-aware load balancing algorithm for P2P systems.**[Citation Graph (, )][DBLP]**Skiptree: A new scalable distributed data structure on multidimensional data supporting range-queries.**[Citation Graph (, )][DBLP]**Query point visibility computation in polygons with holes.**[Citation Graph (, )][DBLP]
Search in 0.057secs, Finished in 0.058secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |