F. Frances Yao

Hao Yuan

Proceedings of the Theory and Applications of Models of Computation, 2017

2014

An $O(n^2)$ Algorithm for Computing Optimal Continuous Voltage Schedules.

[BibT_eX]

[DOI]

Hao Yuan

CoRR, 2014

2013

Minimum CDS in Multihop Wireless Networks with Disparate Communication Ranges.

[BibT_eX]

[DOI]

Lixin Wang

IEEE Trans. Mob. Comput., 2013

2012

Maximizing capacity with power control under physical interference model in duplex mode.

[BibT_eX]

[DOI]

Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011

Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2011

Wireless link scheduling under physical interference model.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Multiflows in multi-channel multi-radio multihop wireless networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010

Approximate Capacity Subregions of Uniform Multihop Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009

A note on universal composable zero-knowledge in the common reference string model.

[BibT_eX]

[DOI]

Yunlei Zhao

Theor. Comput. Sci., 2009

Approximately optimal trees for group key management with batch updates.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2009

A note on the feasibility of generalised universal composability.

[BibT_eX]

[DOI]

Yunlei Zhao

Math. Struct. Comput. Sci., 2009

On the Longest RNG Edge of Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2009

Maximum Independent Set of Links under Physical Interference Model.

[BibT_eX]

[DOI]

Xiaohua Jia

Proceedings of the Wireless Algorithms, 2009

Tighter Approximation Bounds for Minimum CDS in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Algorithmic Problems in Computer and Network Power Management.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008

Lower bounds and new constructions on secure group communication schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Optimizing deletion cost for secure multicast key management.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

On minimum m -connected k -dominating set problem in unit disc graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2008

Improved asymptotic bounds on critical transmission radius for greedy forward routing in wireless ad hoc networks.

[BibT_eX]

[DOI]

Lixin Wang

Chih-Wei Yi

Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2008

Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Lixin Wang

Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 2008

2007

A Distributed and Efficient Flooding Scheme Using 1-Hop Information in Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2007

Algorithms for minimum m-connected k-tuple dominating set problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Optimal Tree Structures for Group Key Management with Batch Updates.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Deniable Internet Key-Exchange.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

k-Nearest-Neighbor Clustering and Percolation Theory.

[BibT_eX]

[DOI]

Shang-Hua Teng

Algorithmica, 2007

A Note on the Feasibility of Generalized Universal Composability.

[BibT_eX]

[DOI]

Yunlei Zhao

Proceedings of the Theory and Applications of Models of Computation, 2007

Approximately Optimal Trees for Group Key Management with Batch Updates.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Algorithms for Minimum m -Connected k -Dominating Set Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2007

2006

Discrete and continuous min-energy schedules for variable voltage processors.

[BibT_eX]

[DOI]

Andrew C. Yao

Proc. Natl. Acad. Sci. USA, 2006

Min-energy voltage allocation for tree-structured tasks.

[BibT_eX]

[DOI]

Becky Jie Liu

J. Comb. Optim., 2006

Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks.

[BibT_eX]

[DOI]

Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2006

Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2006. 25th IEEE International Conference on Computer Communications, 2006

2005

Design and Analysis of Password-Based Key Derivation Functions.

[BibT_eX]

[DOI]

Yiqun Lisa Yin

IEEE Trans. Inf. Theory, 2005

An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Algorithmic Problems in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

1998

A Linear Algorithm for Optimal Context Clustering with Application to Bi-level Image Coding.

[BibT_eX]

[DOI]

Daniel H. Greene

Tong Zhang

Proceedings of the 1998 IEEE International Conference on Image Processing, 1998

1997

Approximating Shortest Superstrings.

[BibT_eX]

[DOI]

Shang-Hua Teng

SIAM J. Comput., 1997

Dictionary Look-Up with One Error.

[BibT_eX]

[DOI]

J. Algorithms, 1997

On Nearest-Neighbor Graphs.

[BibT_eX]

[DOI]

David Eppstein

Discret. Comput. Geom., 1997

A progressive Ziv-Lempel algorithm for image compression.

[BibT_eX]

[DOI]

Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

1995

A Scheduling Model for Reduced CPU Energy.

[BibT_eX]

[DOI]

Alan J. Demers

Scott Shenker

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Dictionary Loop-Up with Small Errors.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

1994

Multi-Index Hashing for Information Retrieval

[BibT_eX]

[DOI]

Daniel H. Greene

Michal Parnas

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1992

Optimal Binary Space Partitions for Orthogonal Objects.

[BibT_eX]

[DOI]

J. Algorithms, 1992

On Nearest-Neighbor Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

The expected extremes in a Delaunay triangulation.

[BibT_eX]

[DOI]

Marshall W. Bern

David Eppstein

Int. J. Comput. Geom. Appl., 1991

Neighborhood Graphs and Geometric Embedding.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1991

Nearest Neighbors Revisited.

[BibT_eX]

[DOI]

Proceedings of the ISA '91 Algorithms, 1991

1990

Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1990

Computing Euclidean Maximum Spanning Trees.

[BibT_eX]

[DOI]

Algorithmica, 1990

Horizon Theorems for Lines and Polygons.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

Computational Geometry.

[BibT_eX]

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

Partitioning Space for Range Queries.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Binary Partitions with Applications to Hidden Surface Removal and Solid Modelling.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

Clustering Algorithms Based on Minimum and Maximum Spanning Trees.

[BibT_eX]

[DOI]

Tetsuo Asano

Binay K. Bhattacharya

J. Mark Keil

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1986

Point Retrieval for Polygons.

[BibT_eX]

[DOI]

J. Algorithms, 1986

Finite-Resolution Computational Geometry

[BibT_eX]

[DOI]

Daniel H. Greene

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

On Fault-Tolerant Networks for Sorting.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

A General Approach to d-Dimensional Geometric Queries (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1983

Finding the Convex Hull of a Simple Polygon.

[BibT_eX]

[DOI]

J. Algorithms, 1983

A 3-Space Partition and Its Applications (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1982

On the Average-Case Complexity of Selecting the kth Best.

[BibT_eX]

[DOI]

SIAM J. Comput., 1982

1980

Some Monotonicity Properties of Partial Orders.

[BibT_eX]

[DOI]

Andrew C. Yao

SIAM J. Algebraic Discret. Methods, 1980

On the Optimality of Linear Merge.

[BibT_eX]

[DOI]

Paul K. Stockmeyer

SIAM J. Comput., 1980

Information Bounds Are Weak in the Shortest Distance Problem.

[BibT_eX]

[DOI]

J. ACM, 1980

Efficient Dynamic Programming Using Quadrangle Inequalities

[BibT_eX]

[DOI]

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

On Translating a Set of Rectangles

[BibT_eX]

[DOI]

Leonidas J. Guibas

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

On the Priority Approach to Hidden-Surface Algorithms (Preliminary Report)

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

Graph 2-Isomorphism is NP-Complete.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1979

1978

Addition chains with multiplicative cost.

[BibT_eX]

[DOI]

Discret. Math., 1978

On the Average-case Complexity of Selecting k-th Best

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1976

Lower Bounds on Merging Networks.

[BibT_eX]

[DOI]

Foong Frances Yao

J. ACM, 1976

The Complexity of Searching an Ordered Random Table (Extended Abstract)

[BibT_eX]

[DOI]