Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Andrew Chi-Chih
    Last name: Yao
    DBLP: y/AndrewChiChihYao
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 100 of 147  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Andrew Chi-Chih Yao, Yunlei Zhao.
    Privacy-Preserving Authenticated Key-Exchange Over Internet.
    IEEE Transactions on Information Forensics and Security 2014, Volume 9 (0) 2014
    Conference paper
    Andrew Chi-Chih Yao, Yunlei Zhao.
    Online/Offline Signatures for Low-Power Devices.
    IEEE Transactions on Information Forensics and Security 2013, Volume 8 (0) 2013
    Conference paper
    Andrew Chi-Chih Yao, Yunlei Zhao.
    OAKE: a new family of implicitly authenticated diffie-hellman protocols.
    2013 ACM SIGSAC Conference on Computer and Communications Security, CCS'13, Berlin, Germany, November 4-8, 2013 2013 (0) 2013
    Conference paper
    Andrew Chi-Chih Yao.
    Quantum Computing: A Great Science in the Making.
    Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Andrew Chi-Chih Yao, Yunlei Zhao.
    Computationally-Fair Group and Identity-Based Key-Exchange.
    Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Xiaoming Sun, Christophe Tartary, Huaxiong Wang, Andrew Chi-Chih Yao.
    Graph Coloring Applied to Secure Computation in Non-Abelian Groups.
    J. Cryptology 2012, Volume 25 (0) 2012
    Conference paper
    Andrew Chi-Chih Yao, Yunlei Zhao.
    Computationally-Fair Group and Identity-Based Key-Exchange.
    IACR Cryptology ePrint Archive 2012, Volume 2012 (0) 2012
    Conference paper
    Andrew Chi-Chih Yao, Yunlei Zhao.
    Digital Signatures from Challenge-Divided Sigma-Protocols.
    IACR Cryptology ePrint Archive 2012, Volume 2012 (0) 2012
    Conference paper
    Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao.
    Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum
    Algorithmica 2011, Volume 59 (0) 2011
    Journal article
    Andrew Chi-Chih Yao, Yunlei Zhao.
    A New Family of Practical Non-Malleable Diffie-Hellman Protocols
    CoRR 2011, Volume 0 (0) 2011
    Journal article
    Andrew Chi-Chih Yao, Yunlei Zhao.
    A New Family of Practical Non-Malleable Protocols.
    IACR Cryptology ePrint Archive 2011, Volume 2011 (0) 2011
    Conference paper
    Andrew Chi-Chih Yao, Yunlei Zhao.
    Deniable Internet Key Exchange.
    Applied Cryptography and Network Security, 8th International Conference, ACNS 2010, Beijing, China, June 22-25, 2010. Proceedings 2010 (0) 2010
    Journal article
    Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao.
    Adaptive Concurrent Non-Malleability with Bare Public-Keys.
    IACR Cryptology ePrint Archive 2010, Volume 2010 (0) 2010
    Journal article
    Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao.
    Concurrent Knowledge Extraction in the Public-Key Model.
    IACR Cryptology ePrint Archive 2010, Volume 2010 (0) 2010
    Journal article
    Robert H. Deng, Yingjiu Li, Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao.
    A New Framework for RFID Privacy.
    IACR Cryptology ePrint Archive 2010, Volume 2010 (0) 2010
    Conference paper
    Andrew Chi-Chih Yao.
    Communication Complexity and Its Applications.
    Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Xiaoming Sun, Andrew Chi-Chih Yao.
    On the Quantum Query Complexity of Local Search in Two and Three Dimensions.
    Algorithmica 2009, Volume 55 (0) 2009
    Conference paper
    Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao.
    Concurrent Knowledge-Extraction in the Public-Key Model
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Andrew Chi-Chih Yao, Moti Yung, Yunlei Zhao.
    Adaptive Concurrent Non-Malleability with Bare Public-Keys
    CoRR 2009, Volume 0 (0) 2009
    Conference paper
    Andrew Chi-Chih Yao, F. Frances Yao, Yunlei Zhao.
    A note on the feasibility of generalised universal composability.
    Mathematical Structures in Computer Science 2009, Volume 19 (0) 2009
    Conference paper
    Andrew Chi-Chih Yao, F. Frances Yao, Yunlei Zhao.
    A note on universal composable zero-knowledge in the common reference string model.
    Theor. Comput. Sci. 2009, Volume 410 (0) 2009
    Conference paper
    Andrew Chi-Chih Yao.
    Some Perspectives on Complexity-Based Cryptography.
    Advances in Cryptology - ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tartary.
    Graph Design for Secure Multiparty Computation over Non-Abelian Groups.
    Advances in Cryptology - ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings 2008 (0) 2008
    Conference paper
    Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun, Andrew Chi-Chih Yao.
    Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems.
    Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA 2008 (0) 2008
    Conference paper
    Andrew Chi-Chih Yao, F. Frances Yao, Yunlei Zhao, Bin Zhu.
    Deniable Internet Key-Exchange.
    IACR Cryptology ePrint Archive 2007, Volume 2007 (0) 2007
    Conference paper
    Andrew Chi-Chih Yao, F. Frances Yao, Yunlei Zhao.
    A Note on Universal Composable Zero Knowledge in Common Reference String Model.
    Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Andrew Chi-Chih Yao, F. Frances Yao, Yunlei Zhao.
    A Note on the Feasibility of Generalized Universal Composability.
    Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Fan Chung Graham, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao.
    Oblivious and Adaptive Strategies for the Majority and Plurality Problems.
    Algorithmica 2007, Volume 48 (0) 2007
    Conference paper
    Xiaoming Sun, Andrew Chi-Chih Yao.
    On the Quantum Query Complexity of Local Search in Two and Three Dimensions.
    47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings 2006 (0) 2006
    Conference paper
    Andrew Chi-Chih Yao.
    Recent Progress in Quantum Computational Complexity.
    Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings 2006 (0) 2006
    Conference paper
    Fan Chung Graham, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao.
    Oblivious and Adaptive Strategies for the Majority and Plurality Problems.
    Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings 2005 (0) 2005
    Conference paper
    Andrew Chi-Chih Yao.
    On the Communication Complexity of Co-linearity Problems.
    Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings 2005 (0) 2005
    Journal article
    Dominic Mayers, Andrew Chi-Chih Yao.
    Self testing quantum apparatus.
    Quantum Information Computation 2004, Volume 4 (0) 2004
    Conference paper
    Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang.
    Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
    19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA 2004 (0) 2004
    Conference paper
    Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao.
    Fisher Equilibrium Price with a Class of Concave Utility Functions.
    Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao.
    Dynamic Price Sequence and Incentive Compatibility (Extended Abstract).
    Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings 2004 (0) 2004
    Conference paper
    Andrew Chi-Chih Yao.
    Graph entropy and quantum sorting problems.
    Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004 2004 (0) 2004
    Conference paper
    Andrew Chi-Chih Yao.
    Interactive Proofs for Quantum Computation.
    Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Fan Chung Graham, Ronald L. Graham, Jia Mao, Andrew Chi-Chih Yao.
    Finding Favorites
    Electronic Colloquium on Computational Complexity (ECCC) 2003, Volume 10 (0) 2003
    Conference paper
    Andrew Chi-Chih Yao.
    Classical physics and the Church-Turing Thesis.
    J. ACM 2003, Volume 50 (0) 2003
    Conference paper
    Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao.
    Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus.
    Combinatorica 2002, Volume 22 (0) 2002
    Conference paper
    Andrew Chi-Chih Yao.
    Classical Physics and the Church-Turing Thesis
    Electronic Colloquium on Computational Complexity (ECCC) 2002, Volume null (0) 2002
    Conference paper
    Andrew Chi-Chih Yao.
    On the Power of Quantum Fingerprinting
    Electronic Colloquium on Computational Complexity (ECCC) 2002, Volume null (0) 2002
    Conference paper
    Amit Chakrabarti, Yaoyun Shi, Anthony Wirth, Andrew Chi-Chih Yao.
    Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity.
    FOCS 2001 (0) 2001
    Conference paper
    Andrew Chi-Chih Yao.
    Some perspective on computational complexity (abstract).
    STOC 2001 (0) 2001
    Conference paper
    Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao.
    Quantum bit escrow.
    STOC 2000 (0) 2000
    Conference paper
    Tomoyuki Yamakami, Andrew Chi-Chih Yao.
    NQP
    Inf. Process. Lett. 1999, Volume 71 (0) 1999
    Conference paper
    Dominic Mayers, Andrew Chi-Chih Yao.
    Quantum Cryptography with Imperfect Apparatus.
    FOCS 1998 (0) 1998
    Conference paper
    Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao.
    An exponential lower bound on the size of algebraic decision trees for Max.
    Computational Complexity 1998, Volume 7 (0) 1998
    Conference paper
    Tomoyuki Yamakami, Andrew Chi-Chih Yao.
    NQP
    CoRR 1998, Volume 0 (0) 1998
    Conference paper
    Tomoyuki Yamakami, Andrew Chi-Chih Yao.
    NQP = co-C
    Electronic Colloquium on Computational Complexity (ECCC) 1998, Volume 5 (0) 1998
    Conference paper
    Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao.
    Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus.
    STOC 1997 (0) 1997
    Conference paper
    Andrew Chi-Chih Yao, F. Frances Yao.
    Dictionary Look-Up with One Error.
    J. Algorithms 1997, Volume 25 (0) 1997
    Conference paper
    Andrew Chi-Chih Yao.
    Decision Tree Complexity and Betti Numbers.
    J. Comput. Syst. Sci. 1997, Volume 55 (0) 1997
    Conference paper
    Andrew Chi-Chih Yao.
    Hypergraphs and Decision Trees (Abstract).
    Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings 1997 (0) 1996
    Conference paper
    Andrew Chi-Chih Yao, F. Frances Yao.
    Dictionary Loop-Up with Small Errors.
    CPM 1995 (0) 1995
    Conference paper
    Andrew Chi-Chih Yao.
    Security of quantum protocols against coherent measurements.
    Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA 1995 (0) 1995
    Conference paper
    Andrew Chi-Chih Yao.
    Minimean Optimal Key Arrangements in Hash Tables.
    Algorithmica 1995, Volume 14 (0) 1995
    Conference paper
    Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao.
    An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX
    Electronic Colloquium on Computational Complexity (ECCC) 1995, Volume 2 (0) 1995
    Conference paper
    Dima Grigoriev, Michael F. Singer, Andrew Chi-Chih Yao.
    On Computing Algebraic Functions Using Logarithms and Exponentials.
    SIAM J. Comput. 1995, Volume 24 (0) 1995
    Conference paper
    Johan Håstad, Alexander A. Razborov, Andrew Chi-Chih Yao.
    On the Shrinkage Exponent for Read-Once Formulae.
    Theor. Comput. Sci. 1995, Volume 141 (0) 1995
    Conference paper
    Andrew Chi-Chih Yao.
    Algebraic Decision Trees and Euler Characteristics.
    Theor. Comput. Sci. 1995, Volume 141 (0) 1995
    Conference paper
    Andrew Chi-Chih Yao.
    A Lower Bound for the Monotone Depth of Connectivity
    35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994 1994 (0) 1994
    Conference paper
    Andrew Chi-Chih Yao.
    Decision tree complexity and Betti numbers.
    STOC 1994 (0) 1994
    Conference paper
    Hing-Fung Ting, Andrew Chi-Chih Yao.
    A Randomized Algorithm for Finding Maximum with O((log n)²) Polynomial Tests.
    Inf. Process. Lett. 1994, Volume 49 (0) 1994
    Conference paper
    Andrew Chi-Chih Yao.
    Near-Optimal Time-Space Tradeoff for Element Distinctness.
    SIAM J. Comput. 1994, Volume 23 (0) 1994
    Conference paper
    Jin-Yi Cai, Richard J. Lipton, Robert Sedgewick, Andrew Chi-Chih Yao.
    Towards Uncheatable benchmarks.
    Structure in Complexity Theory Conference 1993 (0) 1993
    Conference paper
    Andrew Chi-Chih Yao.
    Quantum Circuit Complexity
    34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993 1993 (0) 1993
    Conference paper
    Andrew Chi-Chih Yao.
    Groups and Algebraic Complexity (Abstract).
    Algorithms and Data Structures, Third Workshop, WADS '93, Montréal, Canada, August 11-13, 1993, Proceedings 1993 (0) 1993
    Conference paper
    Ravi Kannan, H. Venkateswaran, V. Vinay, Andrew Chi-Chih Yao.
    A Circuit-Based Proof of Toda's Theorem
    Inf. Comput. 1993, Volume 104 (0) 1993
    Conference paper
    Andrew Chi-Chih Yao.
    Algebraic Decision Trees and Euler Characteristics
    33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992 1992 (0) 1992
    Conference paper
    Anders Björner, László Lovász, Andrew Chi-Chih Yao.
    Linear Decision Trees: Volume Estimates and Topological Bounds
    Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada 1992 (0) 1992
    Conference paper
    Andrew Chi-Chih Yao.
    Recent Progress in Circuit and Communication Complexity (Abstract).
    Fundamentals of Computation Theory, 8th International Symposium, FCT '91, Gosen, Germany, September 9-13, 1991, Proceedings 1991 (0) 1991
    Conference paper
    Sampath Kannan, Andrew Chi-Chih Yao.
    Program Checkers for Probability Generation.
    Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings 1991 (0) 1991
    Conference paper
    Andrew Chi-Chih Yao.
    Weighted Random Assignments with Application to Hashing.
    ISA '91 Algorithms, 2nd International Symposium on Algorithms, Taipei, Republic of China, December 16-18, 1991, Proceedings 1991 (0) 1991
    Conference paper
    Andrew Chi-Chih Yao.
    Lower Bounds to Randomized Algorithms for Graph Properties.
    J. Comput. Syst. Sci. 1991, Volume 42 (0) 1991
    Conference paper
    Andrew Chi-Chih Yao.
    Lower Bounds for Algebraic Computation Trees with Integer Inputs.
    SIAM J. Comput. 1991, Volume 20 (0) 1991
    Conference paper
    Andrew Chi-Chih Yao.
    On ACC and Threshold Circuits
    31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II 1990 (0) 1990
    Conference paper
    Andrew Chi-Chih Yao.
    Coherent Functions and Program Checkers (Extended Abstract)
    Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, USA 1990 (0) 1990
    Conference paper
    Claire Mathieu, Andrew Chi-Chih Yao.
    On Evaluating Boolean Functions with Unreliable Tests.
    Int. J. Found. Comput. Sci. 1990, Volume 1 (0) 1990
    Conference paper
    Andrew Chi-Chih Yao.
    Lower Bounds for Algebraic Computation Trees with Integer Inputs
    30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989 1989 (0) 1989
    Conference paper
    Ronald L. Graham, Andrew Chi-Chih Yao.
    On the Improbability of Reaching Byzantine Agreements (Preliminary Version)
    Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washigton, USA 1989 (0) 1989
    Conference paper
    Andrew Chi-Chih Yao.
    Circuits and Local Computation
    Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washigton, USA 1989 (0) 1989
    Conference paper
    Andrew Chi-Chih Yao.
    On Selecting the k Largest with Median Tests.
    Algorithmica 1989, Volume 4 (0) 1989
    Conference paper
    Andrew Chi-Chih Yao.
    On the Complexity of Partial Order Productions.
    SIAM J. Comput. 1989, Volume 18 (0) 1989
    Conference paper
    Andrew Chi-Chih Yao.
    Near-Optimal Time-Space Tradeoff for Element Distinctness
    29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988 1988 (0) 1988
    Conference paper
    Andrew Chi-Chih Yao.
    Monotone Bipartite Graph Properties are Evasive.
    SIAM J. Comput. 1988, Volume 17 (0) 1988
    Conference paper
    Andrew Chi-Chih Yao.
    Lower Bounds to Randomized Algorithms for Graph Properties (Extended Abstract)
    28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27-29 October 1987 1987 (0) 1987
    Conference paper
    Andrew Chi-Chih Yao.
    How to Generate and Exchange Secrets (Extended Abstract)
    27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986 1986 (0) 1986
    Conference paper
    Andrew Chi-Chih Yao.
    Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version)
    26th Annual Symposium on Foundations of Computer Science, Portland, Oregon, USA, 21-23 October 1985 1985 (0) 1985
    Conference paper
    Andrew Chi-Chih Yao, F. Frances Yao.
    A General Approach to d-Dimensional Geometric Queries (Extended Abstract)
    Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, USA 1985 (0) 1985
    Conference paper
    Andrew Chi-Chih Yao.
    Uniform Hashing Is Optimal
    J. ACM 1985, Volume 32 (0) 1985
    Conference paper
    Andrew Chi-Chih Yao.
    On Optimal Arrangements of Keys with Double Hashing.
    J. Algorithms 1985, Volume 6 (0) 1985
    Conference paper
    Andrew Chi-Chih Yao.
    On the Complexity of Maintaining Partial Sums.
    SIAM J. Comput. 1985, Volume 14 (0) 1985
    Conference paper
    Andrew Chi-Chih Yao.
    On the Expected Performance of Path Compression Algorithms.
    SIAM J. Comput. 1985, Volume 14 (0) 1985
    Conference paper
    Andrew Chi-Chih Yao, F. Frances Yao.
    On Fault-Tolerant Networks for Sorting.
    SIAM J. Comput. 1985, Volume 14 (0) 1985
    Conference paper
    Andrew Chi-Chih Yao.
    Lower Bounds by Probabilistic Arguments (Extended Abstract)
    24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona, USA, 7-9 November 1983 1983 (0) 1983
    Conference paper
    Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao.
    Strong Signature Schemes
    Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA 1983 (0) 1983
    Conference paper
    Danny Dolev, Andrew Chi-Chih Yao.
    On the security of public key protocols.
    IEEE Transactions on Information Theory 1983, Volume 29 (0) 1983
    Conference paper
    Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao.
    On Signatures and Authentication.
    CRYPTO 1982 (0) 1982
    Show item 1 to 100 of 147  

    Your query returned 147 matches in the database.