• 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

• 2023
• 
  Karam Aloui, Damien Jamet, Hajime Kaneko, Steffen Kopecki, Pierre Popoli, Thomas Stoll:
  On the binary digits of n and n². Theor. Comput. Sci. 939: 119-139 (2023)
• 
  Julien Bensmail, Hervé Hocquard, Dimitri Lajou:
  On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs. Theor. Comput. Sci. 939: 105-118 (2023)
• 
  Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
  Stand up indulgent gathering. Theor. Comput. Sci. 939: 63-77 (2023)
• 
  Dora V. Bulgakova, Nicolas Buzhinsky, Yegor O. Goncharov:
  On balanced and abelian properties of circular words over a ternary alphabet. Theor. Comput. Sci. 939: 227-236 (2023)
• 
  Guilhem Castagnos, Dario Catalano, Fabien Laguillaumie, Federico Savasta, Ida Tucker:
  Bandwidth-efficient threshold EC-DSA revisited: Online/offline extensions, identifiable aborts proactive and adaptive security. Theor. Comput. Sci. 939: 78-104 (2023)
• 
  Jannik Castenow, Jonas Harbig, Daniel Jung, Till Knollmann, Friedhelm Meyer auf der Heide:
  Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation. Theor. Comput. Sci. 939: 261-291 (2023)
• 
  Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová:
  On balanced sequences and their critical exponent. Theor. Comput. Sci. 939: 18-47 (2023)
• 
  Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic:
  Implementations and the independent set polynomial below the Shearer threshold. Theor. Comput. Sci. 939: 194-215 (2023)
• 
  Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries:
  Using edge contractions to reduce the semitotal domination number. Theor. Comput. Sci. 939: 140-160 (2023)
• 
  Konstantinos Georgiou, Jesse Lucier:
  Weighted group search on a line & implications to the priority evacuation problem. Theor. Comput. Sci. 939: 1-17 (2023)
• 
  Jianxiong Guo, Xingjian Ding, Tian Wang, Weijia Jia:
  Theoretical design of decentralized auction framework under mobile crowdsourcing environment. Theor. Comput. Sci. 939: 250-260 (2023)
• 
  Yo-Sub Han, Sang-Ki Ko, Kai Salomaa:
  Deciding path size of nondeterministic (and input-driven) pushdown automata. Theor. Comput. Sci. 939: 170-181 (2023)
• 
  Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
  Few induced disjoint paths for H-free graphs. Theor. Comput. Sci. 939: 182-193 (2023)
• 
  Ko Minamisawa, Ryuhei Uehara, Masao Hara:
  Mathematical characterizations and computational complexity of anti-slide puzzles. Theor. Comput. Sci. 939: 216-226 (2023)
• 
  Chunying Ren, Zijun Wu, Dachuan Xu, Wenqing Xu:
  A game-theoretic perspective of deep neural networks. Theor. Comput. Sci. 939: 48-62 (2023)
• 
  Mingyu Xiao:
  Upper and lower bounds on approximating weighted mixed domination. Theor. Comput. Sci. 939: 292-302 (2023)
• 
  Xiaojia Xu, Yongcai Wang, Yu Zhang, Deying Li:
  A fault diagnosis method to defend scapegoating attack in network tomography. Theor. Comput. Sci. 939: 237-249 (2023)
• 
  Yuxing Yang, Ningning Song:
  Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links. Theor. Comput. Sci. 939: 161-169 (2023)