• 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 7,866 matches

• 2024
• 
  Nidia Obscura Acosta, Alexandru I. Tomescu:
  Simplicity in Eulerian circuits: Uniqueness and safety. Inf. Process. Lett. 183: 106421 (2024)
• 
  Akanksha Agrawal, Henning Fernau, Philipp Kindermann, Kevin Mann, Uéverton S. Souza:
  Recognizing well-dominated graphs is coNP-complete. Inf. Process. Lett. 183: 106419 (2024)
• 
  Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho:
  The maximum linear arrangement problem for trees under projectivity and planarity. Inf. Process. Lett. 183: 106400 (2024)
• 
  Júlio Araújo, Victor A. Campos, Darlan Girão, João Nogueira, António Salgueiro, Ana Silva:
  On the hull number on cycle convexity of graphs. Inf. Process. Lett. 183: 106420 (2024)
• 
  Balder ten Cate, Maurice Funk, Jean Christoph Jung, Carsten Lutz:
  On the non-efficient PAC learnability of conjunctive queries. Inf. Process. Lett. 183: 106431 (2024)
• 
  Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah:
  Linear threshold functions in decision lists, decision trees, and depth-2 circuits. Inf. Process. Lett. 183: 106418 (2024)
• 
  Florian Hörsch, Zoltán Szigeti:
  Steiner connectivity problems in hypergraphs. Inf. Process. Lett. 183: 106428 (2024)
• 
  Jean Liénardy, Frédéric Lafitte:
  A weakness in OCB3 used with short nonces allowing for a break of authenticity and confidentiality. Inf. Process. Lett. 183: 106404 (2024)
• 
  Jonas Lingg, Mateus de Oliveira Oliveira, Petra Wolf:
  Learning from positive and negative examples: New proof for binary alphabets. Inf. Process. Lett. 183: 106427 (2024)
• 
  Maximilien Mackie:
  Recursion-free modular arithmetic in the lambda-calculus. Inf. Process. Lett. 183: 106408 (2024)
• 
  Pasin Manurangsi:
  A note on hardness of computing recursive teaching dimension. Inf. Process. Lett. 183: 106429 (2024)
• 
  Majid Mirzanezhad:
  On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions. Inf. Process. Lett. 183: 106405 (2024)
• 
  Takuto Mitsunobu, Reiji Suda, Vorapong Suppakitpaisarn:
  Worst-case analysis of LPT scheduling on a small number of non-identical processors. Inf. Process. Lett. 183: 106424 (2024)
• 
  Kohei Morita, Shinya Shiroshita, Yutaro Yamaguchi, Yu Yokoi:
  Fast primal-dual update against local weight update in linear assignment problem and its application. Inf. Process. Lett. 183: 106432 (2024)
• 
  André Nies, Frank Stephan:
  Word automatic groups of nilpotency class 2. Inf. Process. Lett. 183: 106426 (2024)
• 
  Je Hong Park, Woo-Hwan Kim:
  Security weakness of a certificate-based proxy signature scheme for IIoT environments. Inf. Process. Lett. 183: 106406 (2024)
• 
  Arka Ray:
  There is no APTAS for 2-dimensional vector bin packing: Revisited. Inf. Process. Lett. 183: 106430 (2024)
• 
  Chik How Tan, Theo Fanuela Prabowo:
  A new key recovery attack on a code-based signature from the Lyubashevsky framework. Inf. Process. Lett. 183: 106422 (2024)
• 
  Bhisham Dev Verma, Rameshwar Pratap, Manoj Thakur:
  Unbiased estimation of inner product via higher order count sketch. Inf. Process. Lett. 183: 106407 (2024)
• 
  Shanshan Wang, Chenglong Xiao, Emmanuel Casseau:
  Algorithms with improved delay for enumerating connected induced subgraphs of a large cardinality. Inf. Process. Lett. 183: 106425 (2024)
• 
  Dar-Li Yang, Yung-Tsung Hou, Wen-Hung Kuo:
  A short note on "A note on single-machine scheduling with job-dependent learning effects". Inf. Process. Lett. 183: 106423 (2024)
• 2023
• 
  Abhishek Singh:
  On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times. Inf. Process. Lett. 179: 106305 (2023)
• 
  Riccardo Aragona, Lorenzo Campioni, Roberto Civino, Massimo Lauria:
  Verification and generation of unrefinable partitions. Inf. Process. Lett. 181: 106361 (2023)
• 
  Yossi Azar, Ilan Reuven Cohen, Iftah Gamzu:
  The loss of serving in the dark. Inf. Process. Lett. 180: 106334 (2023)
• 
  Hideo Bannai, Tomohiro I, Dominik Köppl:
  Longest bordered and periodic subsequences. Inf. Process. Lett. 182: 106398 (2023)
• 
  Nikhil Bansal, John Kuszmaul, William Kuszmaul:
  A nearly tight lower bound for the d-dimensional cow-path problem. Inf. Process. Lett. 182: 106389 (2023)
• 
  Gilad Baruch, Shmuel T. Klein, Dana Shapira:
  Guided blocks WOM codes. Inf. Process. Lett. 179: 106312 (2023)
• 
  Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Aditya Pillai:
  Analyzing Residual Random Greedy for monotone submodular maximization. Inf. Process. Lett. 180: 106340 (2023)
• 
  Nathalie Bertrand, Hugo Francon, Nicolas Markey:
  Synchronizing words under LTL constraints. Inf. Process. Lett. 182: 106392 (2023)
• 
  Aniruddha Biswas, Palash Sarkar:
  On the "majority is least stable" conjecture. Inf. Process. Lett. 179: 106295 (2023)

skipping 7,836 more matches