The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

F. Frances Yao: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel H. Greene, F. Frances Yao
    Finite-Resolution Computational Geometry [Citation Graph (2, 0)][DBLP]
    FOCS, 1986, pp:143-152 [Conf]
  2. Andrew Chi-Chih Yao, F. Frances Yao
    The Complexity of Searching an Ordered Random Table (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    FOCS, 1976, pp:173-177 [Conf]
  3. Andrew Chi-Chih Yao, F. Frances Yao
    A General Approach to d-Dimensional Geometric Queries (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    STOC, 1985, pp:163-168 [Conf]
  4. F. Frances Yao
    A 3-Space Partition and Its Applications (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1983, pp:258-263 [Conf]
  5. Tetsuo Asano, Binay K. Bhattacharya, Mark Keil, F. Frances Yao
    Clustering Algorithms Based on Minimum and Maximum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:252-257 [Conf]
  6. Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
    Computing Euclidean Maximum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:241-251 [Conf]
  7. Mike Paterson, F. Frances Yao
    Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:23-32 [Conf]
  8. Andrew Chi-Chih Yao, F. Frances Yao
    Dictionary Loop-Up with Small Errors. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:387-394 [Conf]
  9. Daniel H. Greene, Michal Parnas, F. Frances Yao
    Multi-Index Hashing for Information Retrieval [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:722-731 [Conf]
  10. Shang-Hua Teng, F. Frances Yao
    Approximating Shortest Superstrings [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:158-165 [Conf]
  11. F. Frances Yao
    On the Priority Approach to Hidden-Surface Algorithms (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:301-307 [Conf]
  12. F. Frances Yao, Alan J. Demers, Scott Shenker
    A Scheduling Model for Reduced CPU Energy. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:374-382 [Conf]
  13. Andrew Chi-Chih Yao, F. Frances Yao
    On the Average-case Complexity of Selecting k-th Best [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:280-289 [Conf]
  14. Marshall W. Bern, David Eppstein, F. Frances Yao
    The Expected Extremes in a Delaunay Triangulation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:674-685 [Conf]
  15. Mike Paterson, F. Frances Yao
    On Nearest-Neighbor Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:416-426 [Conf]
  16. Daniel H. Greene, F. Frances Yao, Tong Zhang
    A Linear Algorithm for Optimal Context Clustering with Application to Bi-level Image Coding. [Citation Graph (0, 0)][DBLP]
    ICIP (1), 1998, pp:508-511 [Conf]
  17. F. Frances Yao
    Nearest Neighbors Revisited. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:283- [Conf]
  18. F. Frances Yao
    Algorithmic Problems in Wireless Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:1- [Conf]
  19. Peng-Jun Wan, Chih-Wei Yi, F. Frances Yao, Xiaohua Jia
    Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks. [Citation Graph (0, 0)][DBLP]
    MobiHoc, 2006, pp:25-36 [Conf]
  20. Mike Paterson, F. Frances Yao
    Optimal Binary Space Partitions for Orthogonal Objects. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:100-106 [Conf]
  21. Leonidas J. Guibas, F. Frances Yao
    On Translating a Set of Rectangles [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:154-160 [Conf]
  22. F. Frances Yao
    Efficient Dynamic Programming Using Quadrangle Inequalities [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:429-435 [Conf]
  23. F. Frances Yao
    Neighborhood Graphs and Geometric Embedding. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:201- [Conf]
  24. Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao
    Computing Euclidean Maximum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:3, pp:407-419 [Journal]
  25. David Eppstein, Mike Paterson, F. Frances Yao
    On Nearest-Neighbor Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:17, n:3, pp:263-282 [Journal]
  26. Mike Paterson, F. Frances Yao
    Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:485-503 [Journal]
  27. Marshall W. Bern, David Eppstein, F. Frances Yao
    The expected extremes in a Delaunay triangulation. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1991, v:1, n:1, pp:79-91 [Journal]
  28. F. Frances Yao
    Graph 2-Isomorphism is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:68-72 [Journal]
  29. Ronald L. Graham, Andrew Chi-Chih Yao, F. Frances Yao
    Information Bounds Are Weak in the Shortest Distance Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:3, pp:428-444 [Journal]
  30. Ronald L. Graham, F. Frances Yao
    Finding the Convex Hull of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1983, v:4, n:4, pp:324-331 [Journal]
  31. Mike Paterson, F. Frances Yao
    Point Retrieval for Polygons. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:3, pp:441-447 [Journal]
  32. Mike Paterson, F. Frances Yao
    Optimal Binary Space Partitions for Orthogonal Objects. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:1, pp:99-113 [Journal]
  33. Minming Li, F. Frances Yao
    An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:658-671 [Journal]
  34. Paul K. Stockmeyer, F. Frances Yao
    On the Optimality of Linear Merge. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:85-90 [Journal]
  35. Shang-Hua Teng, F. Frances Yao
    Approximating Shortest Superstrings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:410-417 [Journal]
  36. F. Frances Yao, David P. Dobkin, Herbert Edelsbrunner, Mike Paterson
    Partitioning Space for Range Queries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:371-384 [Journal]
  37. Andrew Chi-Chih Yao, F. Frances Yao
    On the Average-Case Complexity of Selecting the kth Best. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:428-447 [Journal]
  38. Andrew Chi-Chih Yao, F. Frances Yao
    On Fault-Tolerant Networks for Sorting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:120-128 [Journal]
  39. Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Yingshu Li, F. Frances Yao
    Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:366-372 [Conf]
  40. Hai Liu, Peng-Jun Wan, Xiaohua Jia, Xinxin Liu, F. Frances Yao
    Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  41. Weiping Shang, F. Frances Yao, Peng-Jun Wan, Xiaodong Hu
    Algorithms for Minimum m -Connected k -Dominating Set Problem. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:182-190 [Conf]
  42. Weiping Shang, Peng-Jun Wan, F. Frances Yao, Xiaodong Hu
    Algorithms for minimum m-connected k-tuple dominating set problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:381, n:1-3, pp:241-247 [Journal]

  43. On the Longest RNG Edge of Wireless Ad Hoc Networks. [Citation Graph (, )][DBLP]


  44. Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks. [Citation Graph (, )][DBLP]


  45. Approximate Capacity Subregions of Uniform Multihop Wireless Networks. [Citation Graph (, )][DBLP]


  46. Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks. [Citation Graph (, )][DBLP]


  47. Improved asymptotic bounds on critical transmission radius for greedy forward routing in wireless ad hoc networks. [Citation Graph (, )][DBLP]


  48. Maximum Independent Set of Links under Physical Interference Model. [Citation Graph (, )][DBLP]


  49. Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges. [Citation Graph (, )][DBLP]


Search in 0.122secs, Finished in 0.124secs
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