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

• 2021
• 
  Christoph Benzmüller:
  Exploring Simplified Variants of Gödel's Ontological Argument in Isabelle/HOL. Arch. Formal Proofs 2021 (2021)
• 2020
• 
  Mitsuhiro Okada, Yuta Takahashi:
  A Simplified Application of Howard's Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems. WRLA@ETAPS 2020: 136-155
• 
  Mahdokht Afravi, Vladik Kreinovich:
  Fuzzy Systems Are Universal Approximators for Random Dependencies: A Simplified Proof. Decision Making under Constraints 2020: 1-5
• 2019
• 
  Benar Fux Svaiter:
  A simplified proof of weak convergence in Douglas-Rachford method. Oper. Res. Lett. 47(4): 291-293 (2019)
• 2017
• 
  Jiarui Xu, Xuezhe Ma, Chen-Tse Tsai, Eduard H. Hovy:
  STCP: Simplified-Traditional Chinese Conversion and Proofreading. IJCNLP (System Demonstrations) 2017: 61-64
• 2014
• 
  Yuichi Komori, Naosuke Matsuda, Fumika Yamakawa:
  A Simplified Proof of the Church-Rosser Theorem. Stud Logica 102(1): 175-183 (2014)
• 2013
• 
  Ronell Sicat, Markus Hadwiger, Niloy J. Mitra:
  Graph Abstraction for Simplified Proofreading of Slice-based Volume Segmentation. Eurographics (Short Papers) 2013: 77-80
• 2012
• 
  Mark R. Tuttle, Amit Goel:
  Protocol Proof Checking Simplified with SMT. NCA 2012: 195-202
• 2010
• 
  Joachim Wehler:
  Simplified proof of the blocking theorem for free-choice Petri nets. J. Comput. Syst. Sci. 76(7): 532-537 (2010)
• 
  Ilse Fischer:
  The operator formula for monotone triangles - simplified proof and three generalizations. J. Comb. Theory, Ser. A 117(8): 1143-1157 (2010)
• 2009
• 
  Ron Lavi, Ahuva Mu'alem, Noam Nisan:
  Two simplified proofs for Roberts' theorem. Soc. Choice Welf. 32(3): 407-423 (2009)
• 
  Balázs Szörényi:
  Characterizing Statistical Query Learning: Simplified Notions and Proofs. ALT 2009: 186-200
• 
  Mihir Bellare, Thomas Ristenpart:
  Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme. EUROCRYPT 2009: 407-424
• 
  Vamsi Kundeti:
  A Simplified Proof For The Application Of Freivalds' Technique to Verify Matrix Multiplication. CoRR abs/0912.3925 (2009)
• 
  Mihir Bellare, Thomas Ristenpart:
  Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme. IACR Cryptol. ePrint Arch. 2009: 84 (2009)
• 2008
• 
  Fairouz Kamareddine, Vincent Rahli:
  Simplified Reducibility Proofs of Church-Rosser for beta- and betaeta-reduction. LSFA 2008: 85-101
• 2007
• 
  Kedar S. Ranade, Mazhar Ali:
  The Jamiołkowski Isomorphism and a Simplified Proof for the Correspondence Between Vectors Having Schmidt Number k and k-Positive Maps. Open Syst. Inf. Dyn. 14(4): 371-378 (2007)
• 2002
• 
  Ingo Wegener:
  A simplified correctness proof for a well-known algorithm computing strongly connected components. Inf. Process. Lett. 83(1): 17-19 (2002)
• 
  Géraud Sénizergues:
  L(A)=L(B)? A simplified decidability proof. Theor. Comput. Sci. 281(1-2): 555-608 (2002)
• 2001
• 
  Nikolai K. Vereshchagin:
  An enumerable undecidable set with low prefix complexity: a simplified proof. Electron. Colloquium Comput. Complex.(083) (2001)
• 2000
• 
  Peter Høyer:
  Simplified proof of the Fourier Sampling Theorem. Inf. Process. Lett. 75(4): 139-143 (2000)
• 1998
• 
  Brigitte Jaumard, Christophe Meyer:
  A Simplified Convergence Proof for the Cone Partitioning Algorithm. J. Glob. Optim. 13(4): 407-416 (1998)
• 1997
• 
  Thierry Lacoste:
  A Simplified Proof of the 0-1 Law for Existential Second-Order Ackermann Sentences. Math. Log. Q. 43: 413-418 (1997)
• 1996
• 
  Alasdair Urquhart, Xudong Fu:
  Simplified Lower Bounds for Propositional Proofs. Notre Dame J. Formal Log. 37(4): 523-544 (1996)
• 
  Si-Qing Zheng:
  Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs. Networks 28(1): 15-19 (1996)
• 1995
• 
  Jörg Desel, Ekkart Kindler, Tobias Vesper, Rolf Walter:
  A Simplified Proof for a Self-Stabilizing Protocol: A Game of Cards. Inf. Process. Lett. 54(6): 327-328 (1995)
• 
  Harold T. Wareham:
  A Simplified Proof of the NP- and MAX SNP-Hardness of Multiple Sequence Tree Alignment. J. Comput. Biol. 2(4): 509-514 (1995)
• 1994
• 
  Jan Willem Klop, Aart Middeldorp, Yoshihito Toyama, Roel C. de Vrijer:
  Modularity of Confluence: A Simplified Proof. Inf. Process. Lett. 49(2): 101-109 (1994)
• 
  Ronald Cramer, Ivan Damgård, Berry Schoenmakers:
  Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. CRYPTO 1994: 174-187
• 1993
• 
  Renato D. C. Monteiro, Takashi Tsuchiya, Y. Wang:
  A simplified global convergence proof of the affine scaling algorithm. Ann. Oper. Res. 46-47(2): 443-482 (1993)

skipping 8 more matches