• MONA

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

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

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

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

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

  • Referenced in 11 articles [sw31693]
  • Angle-Propagation Theta* achieves a better worst-case complexity per vertex expansion than Basic Theta...
  • BEDFix

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

  • Referenced in 5 articles [sw31752]
  • ADMBB algorithm and estimate its complexity. Second, we develop a global search algorithm ... within (epsilon )-tolerance and estimate the worst-case complexity bound of the GSA. Preliminary numerical...
  • GADMM

  • Referenced in 29 articles [sw12640]
  • show the worst-case O(1/k) convergence rate measured by the iteration complexity k represents...
  • ltl2dstar

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

  • Referenced in 2 articles [sw39787]
  • Worst-Case Complexity of TimSort. TimSort is an intriguing sorting algorithm designed ... Python, whose worst-case complexity was announced, but not proved until our recent preprint...
  • 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...
  • linLIR

  • Referenced in 4 articles [sw11393]
  • show that it has worst-case time complexity O(n 3 logn). We have implemented...
  • 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...
  • D* Extra Lite

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

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

  • Referenced in 4 articles [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...
  • MuRoCo

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

  • Referenced in 2 articles [sw22013]
  • respectively. Albeit having a good worst-case time complexity [Formula: see text], the exact approach...
  • DBSCAN++

  • Referenced in 1 article [sw34904]
  • point, leading to a quadratic worst-case time complexity, which is too slow on large...