• Clusion

  • Referenced in 1 article [sw23225]
  • have sub-linear asymptotic search complexity in the worst-case. Clusion is provided...
  • KADABRA

  • Referenced in 4 articles [sw25810]
  • outperforms all previous approaches on real-world complex networks. The efficiency of the new algorithm ... with respect to the $Theta(|E|)$ worst-case performance. We experimentally show that this ... technique achieves similar speedups on real-world complex networks, as well. par The second contribution...
  • TRE

  • Referenced in 3 articles [sw30071]
  • text being searched, and quadratic worst-case time in the length of the used regular ... expression. In other words, the time complexity of the algorithm is O(M^2N), where...
  • McAiT

  • Referenced in 3 articles [sw09947]
  • McAiT, a tool for estimating the Worst-Case Execution Times (WCET) of programs running ... shared caches. McAiT also allows for modeling complex task models, such as synchronization, jitter ... Path Enumeration Technique (IPET) combined with worst-case shared resource access delay for WCET estimation...
  • FLOTT

  • Referenced in 1 article [sw20576]
  • compute the string complexity measure T-complexity. The algorithm uses approximately one third ... flott implementation has the same worst-case memory requirements as state of the art suffix ... efficiently compute the Lempel-Ziv production complexity, which is another measure of string complexity...
  • PASTA

  • Referenced in 2 articles [sw02145]
  • worst-case analysis, Monte Carlo analysis, yield optimization and design centring, the variations and correlations ... placed on analogue simulation owing to the complex connections between circuit design and technology ... circuit analysis and optimization (limit parameters, worst-case distances) as well as Monte Carlo analysis...
  • ProSparse

  • Referenced in 1 article [sw24951]
  • This paper studies ProSparse, a new polynomial complexity algorithm that solves the sparse representation problem ... previous work, which establishes deterministic (worst-case) sparsity bounds for ProSparse to succeed, this paper...
  • IQC-Game

  • Referenced in 1 article [sw39462]
  • negative momentum method (NM) with an iteration complexity (mathcal{O}(kappa^{1.5})), which matches ... step size achieves the fastest provable worst-case convergence rate with quadratic Lyapunov functions. Finally...
  • Trickle

  • Referenced in 0 articles [sw22323]
  • compute safe bounds on the worst-case execution time (WCET) of programs. For large programs ... abstractions are often required to curb computational complexity. These abstractions may introduce infeasible paths which...
  • ARVO

  • Referenced in 14 articles [sw00049]
  • ARVO: A Fortran package for computing the solvent...
  • BARON

  • Referenced in 361 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • Boolector

  • Referenced in 32 articles [sw00085]
  • Boolector: an efficient SMT solver for bit-vectors...
  • GAP

  • Referenced in 3221 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • GLOPT

  • Referenced in 19 articles [sw00359]
  • GLOPT is a Fortran 77 program for global...
  • LANGAGE

  • Referenced in 39 articles [sw00501]
  • LANGAGE: A Maple package for automaton characterization of...
  • LEDA

  • Referenced in 264 articles [sw00509]
  • In the core computer science areas -- data structures...
  • LinBox

  • Referenced in 41 articles [sw00522]
  • LinBox: A Generic Library for Exact Linear Algebra...
  • LSQR

  • Referenced in 410 articles [sw00530]
  • Algorithm 583: LSQR: Sparse Linear Equations and Least...
  • Magma

  • Referenced in 3363 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...
  • Maple

  • Referenced in 5403 articles [sw00545]
  • The result of over 30 years of cutting...