• MONA

  • Referenced in 113 articles [sw06170]
  • faces a theoretically non-elementary worst-case complexity. The implementation has matured over a period...
  • DSDP5

  • Referenced in 26 articles [sw04411]
  • convergence proof with polynomially bounded worst-case complexity, primal and dual feasible solutions when they...
  • Blossom V

  • Referenced in 19 articles [sw04780]
  • priority queues does not improve the worst-case complexity, it appears to lead...
  • na24

  • Referenced in 12 articles [sw11485]
  • Envelope (PE) algorithms are performed. Worst-case time complexity, convergence results, and examples are included ... reduce the brute force quadratic worst-case time complexity to linear time by using either...
  • BEDFix

  • Referenced in 8 articles [sw04469]
  • method averaged 31 percent of this worst-case bound. BEDFix works for nonsmooth continuous functions ... Lipschitz constants equal to 1, whereas the complexity of simple iteration approaches infinity ... compute absolute criterion solutions, the worst-case complexity depends on the logarithm of the reciprocal...
  • ltl2dstar

  • Referenced in 4 articles [sw21007]
  • deterministic Rabin automata, which has a worst-case complexity of 2O(n log n), with...
  • ANewDsc

  • Referenced in 4 articles [sw19984]
  • achieves record bounds on the worst-case complexity for the considered problem, matching the complexity...
  • TRecS

  • Referenced in 2 articles [sw14145]
  • Luke Ong in 2006, but its worst-case complexity is k-EXPTIME complete for order ... many typical inputs, despite the huge worst-case complexity. Since the development of TRecS...
  • Algorithm 848

  • Referenced in 2 articles [sw04408]
  • defined on all rectangular domains, the worst-case complexity of PFix has order equal ... order of the worst-case bound for the case of the unit hypercube. PFix ... found in the authors’ paper [J. Complexity...
  • GADMM

  • Referenced in 15 articles [sw12640]
  • worst-case $mathcal{O}(1/k)$ convergence rate measured by the iteration complexity ($k$ represents...
  • LoAT

  • Referenced in 3 articles [sw23213]
  • infer lower bounds on the worst-case runtime complexity of integer programs. To this...
  • linLIR

  • Referenced in 3 articles [sw11393]
  • show that it has worst-case time complexity O(n 3 logn). We have implemented...
  • D* Extra Lite

  • Referenced in 1 article [sw20992]
  • search-tree branch cutting. The provided worst-case complexity analysis strongly suggests that D* Extra...
  • MuRoCo

  • Referenced in 1 article [sw06548]
  • yields a lower increase of the worst-case complexity compared to previous solutions, while still...
  • ALFRED

  • Referenced in 1 article [sw22013]
  • respectively. Albeit having a good worst-case time complexity [Formula: see text], the exact approach...
  • Clusion

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

  • Referenced in 1 article [sw27564]
  • lower annotation burden, and, furthermore, big-O complexity can be inferred from recurrences generated during ... usability by implementing a broad suite of case-study modules, demonstrating that TiML, though lacking ... versatile enough to verify worst-case and/or amortized complexities for algorithms and data structures like...
  • KADABRA

  • Referenced in 2 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...
  • McAiT

  • Referenced in 2 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...