• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 16 matches

• 2019
• 
  Sahin Emrah Amrahov, Adnan Saher Mohammed, Fatih V. Çelebi:
  New and improved search algorithms and precise analysis of their average-case complexity. Future Gener. Comput. Syst. 95: 743-753 (2019)
• 
  Alexey A. Khartov, Marguerite Zani:
  Asymptotic analysis of average case approximation complexity of additive random fields. J. Complex. 52: 24-44 (2019)
• 2015
• 
  Alexey A. Khartov:
  Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements. J. Complex. 31(6): 835-866 (2015)
• 2012
• 
  Niraj Kumar Singh, Soubhik Chakraborty:
  Partition Sort versus Quick Sort: A Comparative Average Case Analysis with Special Emphasis on Parameterized Complexity. ACITY (2) 2012: 107-113
• 2007
• 
  Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao:
  On the analysis of average time complexity of estimation of distribution algorithms. IEEE Congress on Evolutionary Computation 2007: 453-460
• 2002
• 
  Jun He, Xin Yao:
  Erratum to: Drift analysis and average time complexity of evolutionary algorithms [Artificial Intelligence 127 (2001) 57-85]. Artif. Intell. 140(1/2): 245-248 (2002)
• 2001
• 
  Jun He, Xin Yao:
  Drift analysis and average time complexity of evolutionary algorithms. Artif. Intell. 127(1): 57-85 (2001)
• 
  Marc R. C. van Dongen:
  A Theoretical Analysis of the Average-Time Complexity of Domain-Heuristics for Arc-Consistency Algorithms. JFPLC 2001: 27-42
• 
  Sethuraman Panchanathan, Karthik Ramaswamy, Jian-Jun Fang, Kathy Moseler, Sami Levi:
  Complexity analysis of two-pass algorithm and elliptical weighted average filter for VLSI implementation of perspective texture warping. VCIP 2001: 330-339
• 2000
• 
  Tao Jiang, Ming Li, Paul M. B. Vitányi:
  Average-Case Analysis of Algorithms Using Kolmogorov Complexity. J. Comput. Sci. Technol. 15(5): 402-408 (2000)
• 1998
• 
  Ming Li, Paul M. B. Vitányi:
  Average-Case Analysis Using Kolgomorov Complexity (Abstract). CATS 1998: 1-4
• 1997
• 
  Ming Li, Paul M. B. Vitányi:
  Average-Case Analysis Using Kolmogorov Complexity. Advances in Algorithms, Languages, and Complexity 1997: 157-169
• 1995
• 
  Rainer Schuler, Osamu Watanabe:
  Towards Average-Case Complexity Analysis of NP Optimization Problems. Computational Complexity Conference 1995: 148-159
• 1990
• 
  Jeffrey Scott Vitter, Philippe Flajolet:
  Average-Case Analysis of Algorithms and Data Structures. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 431-524
• 1989
• 
  Luc Albert:
  Average Case Complexity Analysis of RETE Pattern-Match Algorithm and Average Size of Join in Database. FSTTCS 1989: 223-241
• 1988
• 
  Luc Albert, François Fages:
  Average Case Complexity Analysis of the Rete Multi-Pattern Match Algorithm. ICALP 1988: 18-37