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

• 2017
• 
  Moulay A. Barkatou, Paola Boito, Esteban Segura Ugalde:
  A contour integral approach to the computation of invariant pairs. Theor. Comput. Sci. 681: 3-26 (2017)
• 
  Dmitry Batenkov:
  Accurate solution of near-colliding Prony systems via decimation and homotopy continuation. Theor. Comput. Sci. 681: 27-40 (2017)
• 
  Mohamed Elkadi, André Galligo:
  On mixed polynomials of bidegree (n, 1). Theor. Comput. Sci. 681: 41-53 (2017)
• 
  Martin Helmer:
  A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties. Theor. Comput. Sci. 681: 54-74 (2017)
• 
  Yi Li:
  Witness to non-termination of linear programs. Theor. Comput. Sci. 681: 75-100 (2017)
• 
  Victor Y. Pan, Elias P. Tsigaridas:
  Nearly optimal computations with structured matrices. Theor. Comput. Sci. 681: 117-137 (2017)
• 
  Victor Y. Pan, Elias P. Tsigaridas:
  Accelerated approximation of the complex roots and factors of a univariate polynomial. Theor. Comput. Sci. 681: 138-145 (2017)
• 
  Victor Y. Pan, Liang Zhao:
  Real polynomial root-finding by means of matrix and polynomial iterations. Theor. Comput. Sci. 681: 101-116 (2017)
• 
  Dierk Schleicher, Robin Stoll:
  Newton's method in practice: Finding all roots of polynomials of degree one million efficiently. Theor. Comput. Sci. 681: 146-166 (2017)
• 
  Hiroshi Sekigawa:
  The nearest polynomial to multiple given polynomials with a given zero in the real case. Theor. Comput. Sci. 681: 167-175 (2017)
• 
  Konstantin Usevich, Ivan Markovsky:
  Variable projection methods for approximate (greatest) common divisor computations. Theor. Comput. Sci. 681: 176-198 (2017)
• 
  Jan Verschelde, Stephen M. Watt, Lihong Zhi:
  TCS SNC Preface. Theor. Comput. Sci. 681: 1-2 (2017)
• 
  Wei-guo Wang, Yimin Wei:
  Mixed and componentwise condition numbers for matrix decompositions. Theor. Comput. Sci. 681: 199-216 (2017)
• 
  Wenyuan Wu, Greg Reid, Yong Feng:
  Computing real witness points of positive dimensional polynomial systems. Theor. Comput. Sci. 681: 217-231 (2017)