✦ LIBER ✦

Worst-case behavior of string-searching algorithms

✍ Scribed by Zsolt Tuza

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 649 KB
Volume: 6
Category: Article
ISSN: 0378-3758
DOI: 10.1016/0378-3758(82)90060-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst case behavior of the Dinic algorit

Worst case behavior of the Dinic algorithm

✍ Gary R. Waissi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 292 KB

Worst-case analysis of a scheduling algo

Worst-case analysis of a scheduling algorithm

✍ Jeremy Spinrad 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Generation of Well-Formed Parenthesis St

Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time

✍ Timothy R. Walsh 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 222 KB

Proskurowski and Ruskey J. Algorithms 11 1990 , 68᎐84 published a recursive algorithm for generating well-formed parenthesis strings of length 2 n and challenged the reader to find a loop-free version of their algorithm. We present two nonrecursive versions of their algorithm, one of which generates

Worst-case performance of approximation

Worst-case performance of approximation algorithms for tool management problems

✍ Yves Crama; Joris van de Klundert 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 2 views

Since the introduction of flexible manufacturing systems, researchers have investigated various planning and scheduling problems faced by the users of such systems. Several of these problems are not encountered in more classical production settings, and so-called tool management problems appear to b

Worst-case optimality of smoothing algor

Worst-case optimality of smoothing algorithms for parametric system identification

✍ Roberto Tempo 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 439 KB

We study parametric identification of uncertain systems in a deterministic setting. We assume that the problem data and the linearly parameterized system model are given. In the presence of a priori information and norm-bounded noise, we design optimal worst-case algorithms. In particular, we study

On the Asymptotic Worst Case Behavior of

On the Asymptotic Worst Case Behavior of Harmonic Fit

✍ André van Vliet 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 219 KB

In the parametric bin packing problem we must pack a list of items with size smaller than or equal to 1rr in a minimal number of unit-capacity bins. Among the Ž . approximation algorithms, the class of Harmonic Fit algorithms HF plays an M