✦ LIBER ✦

An O(n log m) algorithm for VLSI design rule checking

✍ Scribed by Bonapace, C.R.; Lo, C.-Y.

Book ID: 119777591
Publisher: IEEE
Year: 1992
Tongue: English
Weight: 665 KB
Volume: 11
Category: Article
ISSN: 0278-0070
DOI: 10.1109/43.137520

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The halo algorithm-an algorithm for hier

The halo algorithm-an algorithm for hierarchical design of rule checking of VLSI circuits

✍ Hedenstierna, N.; Jeppson, K.O. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 909 KB

An O(n log n + m log log n) maximum weig

An O(n log n + m log log n) maximum weight clique algorithm for circular-arc graphs

✍ Wei-Kuan Shih; Wen-Lian Hsu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 852 KB

An O(n log m) algorithm for the Josephus

An O(n log m) algorithm for the Josephus Problem

✍ Errol L Lloyd 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 458 KB

An O(N log N) Algorithm for Shape Modeli

An O(N log N) Algorithm for Shape Modeling

✍ R. Malladi and J. A. Sethian 📂 Article 📅 1996 🏛 National Academy of Sciences 🌐 English ⚖ 790 KB

An O(n log n log log n) parallel maximum

An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs

✍ Taenam Kim; Kyung-Yong Chwa 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 170 KB

An O(n log n) algorithm for finding diss

An O(n log n) algorithm for finding dissimilar strings

✍ Sarmad Abbasi; Anirvan Sengupta 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 411 KB

Let P be a finite alphabet and x E Z'. A string y E Zm is said to be k-dissimilar to x, if no k length substring of x is equal to any k length substring of y. We present an 0( n log n) algorithm which on input x E 2? and an integer m < n outputs an integer k and y E .Zm such that: (1) y is k-dissimi