• 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 18 matches

• 2020
• 
  Eric Allender:
  Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity. Complexity and Approximation 2020: 8-18
• 
  Vincent Chau, Minming Li:
  Active and Busy Time Scheduling Problem: A Survey. Complexity and Approximation 2020: 219-229
• 
  Chi-Yeh Chen, Sun-Yuan Hsieh:
  An Efficient Approximation Algorithm for the Steiner Tree Problem. Complexity and Approximation 2020: 238-251
• 
  Xujin Chen, Xiaodong Hu, Mengqi Zhang:
  Sequential Location Game on Continuous Directional Star Networks. Complexity and Approximation 2020: 187-204
• 
  Ding-Zhu Du, Jie Wang:
  In Memoriam: Ker-I Ko (1950-2018). Complexity and Approximation 2020: 1-7
• 
  Lane A. Hemaspaandra:
  The Power of Self-Reducibility: Selectivity, Information, and Approximation. Complexity and Approximation 2020: 19-47
• 
  Shuichi Hirahara, Osamu Watanabe:
  On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets. Complexity and Approximation 2020: 67-79
• 
  Siwen Liu:
  A Review for Submodular Optimization on Machine Scheduling Problems. Complexity and Approximation 2020: 252-267
• 
  Jan-Hendrik Lorenz, Uwe Schöning:
  Promise Problems on Probability Distributions. Complexity and Approximation 2020: 57-66
• 
  Chuanwen Luo, Liya Xu, Deying Li, Weili Wu:
  Edge Computing Integrated with Blockchain Technologies. Complexity and Approximation 2020: 268-288
• 
  Jack H. Lutz, Neil Lutz:
  Who Asked Us? How the Theory of Computing Answers Questions about Analysis. Complexity and Approximation 2020: 48-56
• 
  Qingqin Nong, Suning Gong, Qizhi Fang, Ding-Zhu Du:
  A Survey on Double Greedy Algorithms for Maximizing Non-monotone Submodular Functions. Complexity and Approximation 2020: 172-186
• 
  Erfang Shan, Jilei Shi, Wenrong Lv:
  A Note on the Position Value for Hypergraph Communication Situations. Complexity and Approximation 2020: 230-237
• 
  Shu-Ming Sun, Ning Zhong, Martin Ziegler:
  Computability of the Solutions to Navier-Stokes Equations via Effective Approximation. Complexity and Approximation 2020: 80-112
• 
  Xiaoming Sun, Yuan Sun, Jialin Zhang:
  Better Upper Bounds for Searching on a Line with Byzantine Robots. Complexity and Approximation 2020: 151-171
• 
  Jie Wang:
  AutoOverview: A Framework for Generating Structured Overviews over Many Documents. Complexity and Approximation 2020: 113-150
• 
  Feiteng Zhang, Bin Liu, Qizhi Fang:
  Core Decomposition, Maintenance and Applications. Complexity and Approximation 2020: 205-218
• 
  Ding-Zhu Du, Jie Wang:
  Complexity and Approximation - In Memory of Ker-I Ko. Lecture Notes in Computer Science 12000, Springer 2020, ISBN 978-3-030-41671-3 [contents]