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

• 2001
• 
  Fabio Alessi, Mariangiola Dezani-Ciancaglini, Furio Honsell:
  Filter Models and Easy Terms. ICTCS 2001: 17-37
• 
  Davide Ancona, Christopher Anderson, Ferruccio Damiani, Sophia Drossopoulou, Paola Giannini, Elena Zucca:
  An Effective Translation of Fickle into Java. ICTCS 2001: 215-234
• 
  Marcella Anselmo:
  Constructing Finite Maximal Codes from Schützenberger Conjecture. ICTCS 2001: 197-214
• 
  Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni:
  Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. ICTCS 2001: 312-327
• 
  Matteo Baldoni, Laura Giordano, Alberto Martelli, Viviana Patti:
  Reasoning about Complex Actions with Incomplete Knowledge: A Modal Approach. ICTCS 2001: 405-425
• 
  Daniela Besozzi, Claudio Zandron, Giancarlo Mauri, Nicoletta Sabadini:
  P Systems with Gemmation of Mobile Membranes. ICTCS 2001: 136-153
• 
  Michele Bugliesi, Giuseppe Castagna, Silvia Crafa:
  Subtyping and Matching for Mobile Objects. ICTCS 2001: 235-255
• 
  Diletta Cacciagrano, Flavio Corradini:
  On Synchronous and Asynchronous Communication Paradigms. ICTCS 2001: 256-268
• 
  Alessandra Cherubini, Stefano Crespi-Reghizzi, Pierluigi San Pietro:
  Some Structural Properties of Associative Language Descriptions. ICTCS 2001: 172-183
• 
  Stelvio Cimato, Annalisa De Bonis:
  Online Advertising: Secure E-coupons. ICTCS 2001: 370-383
• 
  Mario Coppo, Daniel Hirschkoff:
  Incremental Inference of Partial Types. ICTCS 2001: 50-73
• 
  Paolo D'Arco:
  On the Distribution of a Key Distribution Center. ICTCS 2001: 357-369
• 
  Gian-Luigi Ferrari, Ugo Montanari, Emilio Tuosto:
  A LTS Semantics of Ambients via Graph Synchronization with Mobility. ICTCS 2001: 1-16
• 
  Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski:
  Distance Constrained Labeling of Precolored Trees. ICTCS 2001: 285-292
• 
  Silvia Ghilezan, Viktor Kuncak:
  Confluence of Untyped Lambda Calculus via Simple Types. ICTCS 2001: 38-49
• 
  Dora Giammarresi, Rosa Montalbano, Derick Wood:
  Block-Deterministic Regular Languages. ICTCS 2001: 184-196
• 
  André Große, Jörg Rothe, Gerd Wechsung:
  Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions. ICTCS 2001: 339-356
• 
  Juraj Hromkovic, Kathleen Steinhöfel, Peter Widmayer:
  Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. ICTCS 2001: 90-106
• 
  Lars Jacobsen, Kim S. Larsen:
  Complexity of Layered Binary Search Trees with Relaxed Balance. ICTCS 2001: 269-284
• 
  Lars Jacobsen, Kim S. Larsen:
  Exponentially Decreasing Number of Operations in Balanced Trees. ICTCS 2001: 293-311
• 
  Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
  Job Shop Scheduling Problems with Controllable Processing Times. ICTCS 2001: 107-122
• 
  Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito:
  Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. ICTCS 2001: 328-338
• 
  Carlo Mereghetti, Beatrice Palano:
  Upper Bounds on the Size of One-Way Quantum Finite Automata. ICTCS 2001: 123-135
• 
  Nicola Olivetti, Camilla Schwind:
  A Calculus and Complexity Bound for Minimal Conditional Logic. ICTCS 2001: 384-404
• 
  Luca Paolini:
  Call-by-Value Separability and Computability. ICTCS 2001: 74-89
• 
  Giuseppe Prencipe:
  Instantaneous Actions vs. Full Asynchronicity : Controlling and Coordinating a Set of Autonomous Mobile Robots. ICTCS 2001: 154-171
• 
  Emanuele Viola:
  E-unifiability via Narrowing. ICTCS 2001: 426-438
• 
  Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi:
  Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings. Lecture Notes in Computer Science 2202, Springer 2001, ISBN 3-540-42672-8 [contents]