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

• 2023
• 
  Tamaz Chelidze, Teimuraz Matcharashvili, Ekaterine Mepharidze, Nadezhda Dovgal:
  Complexity in Geophysical Time Series of Strain/Fracture at Laboratory and Large Dam Scales: Review. Entropy 25(3): 467 (2023)
• 2021
• 
  Waqas Haider, Muhammad Wasif Nisar, Tanzila Saba, Muhammad Sharif, Raja Umair Haider, Nadeem Muhammad Bilal, Muhammad Attique Khan:
  A complexity reduced and reliable integrity protection for large relational data over clouds. Int. J. Inf. Comput. Secur. 15(1): 49-66 (2021)
• 
  Atsuo Murata, Waldemar Karwowski:
  On the Root Causes of the Fukushima Daiichi Disaster from the Perspective of High Complexity and Tight Coupling in Large-Scale Systems. Symmetry 13(3): 414 (2021)
• 2020
• 
  Sándor Szedmák, Anna Cichonska, Heli Julkunen, Tapio Pahikkala, Juho Rousu:
  A Solution for Large Scale Nonlinear Regression with High Rank and Degree at Constant Memory Complexity via Latent Tensor Reconstruction. CoRR abs/2005.01538 (2020)
• 2019
• 
  Tarek Hagras, Asmaa Atef, Yousef B. Mahdy:
  Lower-bound time-complexity greening mechanism for duplication-based scheduling on large-scale computing platforms. J. Supercomput. 75(12): 8147-8167 (2019)
• 2016
• 
  Carlos Gershenson:
  Complexity at large. Complex. 21(3): 3-8 (2016)
• 
  Carlos Gershenson:
  Complexity at Large. Complex. 21(4): 3-6 (2016)
• 
  Carlos Gershenson:
  Complexity at large - 21.5. Complex. 21(5): 5-10 (2016)
• 2015
• 
  Carlos Gershenson:
  Complexity at large. Complex. 20(3): 1-7 (2015)
• 
  Carlos Gershenson:
  Complexity at large. Complex. 20(4): 1-5 (2015)
• 
  Carlos Gershenson:
  Complexity at large: News items. Complex. 21(1): 1-5 (2015)
• 
  Carlos Gershenson:
  Complexity at Large - 21.2. Complex. 21(2): 1-8 (2015)
• 
  Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu:
  On the complexity of finding a largest common subtree of bounded degree. Theor. Comput. Sci. 590: 2-16 (2015)
• 2014
• 
  Carlos Gershenson:
  Complexity at large - 19.3. Complex. 19(3): 1-6 (2014)
• 
  Carlos Gershenson:
  Complexity at large-19.4. Complex. 19(4): 1-9 (2014)
• 
  Carlos Gershenson:
  Complexity at large. Complex. 19(5): 1-5 (2014)
• 
  Carlos Gershenson:
  Complexity at large. Complex. 20(1): 1-10 (2014)
• 2013
• 
  Carlos Gershenson:
  Complexity At Large. Complex. 18(5): 1-4 (2013)
• 
  Carlos Gershenson:
  Complexity at large. Complex. 18(6): 1-6 (2013)
• 
  Carlos Gershenson:
  Complexity at large - 19.2. Complex. 19(2): 1-5 (2013)
• 
  Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu:
  On the Complexity of Finding a Largest Common Subtree of Bounded Degree. FCT 2013: 4-15
• 2012
• 
  Carlos Gershenson:
  Complexity at large - March 2012. Complex. 17(4): 1-4 (2012)
• 
  Carlos Gershenson:
  Complexity at large. Complex. 18(1): 1-6 (2012)
• 
  Carlos Gershenson:
  Complexity at large. Complex. 18(2): 1-4 (2012)
• 
  Joseph Reddington, Kubilay Atasu:
  Complexity of Computing Convex Subgraphs in Custom Instruction Synthesis. IEEE Trans. Very Large Scale Integr. Syst. 20(12): 2337-2341 (2012)
• 2011
• 
  Carlos Gershenson:
  Complexity at large. Complex. 16(3): 1-5 (2011)
• 
  Carlos Gershenson:
  Complexity at large. Complex. 16(4): 1-5 (2011)
• 
  Carlos Gershenson:
  Complexity at large. Complex. 16(6): 1-4 (2011)
• 
  Carlos Gershenson:
  Complexity at large. Complex. 17(1): 1-4 (2011)
• 2010
• 
  Carlos Gershenson:
  Complexity at large. Complex. 15(6): 3-6 (2010)

skipping 31 more matches