Fujimori, Yusei; Kawase, Yasushi; Matsui, Tomomi; Shioura, Akiyoshi A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption. (English) Zbl 1462.68015 Inf. Process. Lett. 162, Article ID 105991, 4 p. (2020). MSC: 68M20 PDFBibTeX XMLCite \textit{Y. Fujimori} et al., Inf. Process. Lett. 162, Article ID 105991, 4 p. (2020; Zbl 1462.68015) Full Text: DOI
Sun, Hongyang Non-clairvoyant scheduling with conflicts for unit-size jobs. (English) Zbl 1478.68028 Inf. Process. Lett. 144, 1-8 (2019). MSC: 68M20 68W27 90B35 PDFBibTeX XMLCite \textit{H. Sun}, Inf. Process. Lett. 144, 1--8 (2019; Zbl 1478.68028) Full Text: DOI
Bérczi, Kristóf; Bérczi-Kovács, Erika R. Directed hypergraphs and Horn minimization. (English) Zbl 1420.68154 Inf. Process. Lett. 128, 32-37 (2017). MSC: 68R05 05C65 05C85 06E30 PDFBibTeX XMLCite \textit{K. Bérczi} and \textit{E. R. Bérczi-Kovács}, Inf. Process. Lett. 128, 32--37 (2017; Zbl 1420.68154) Full Text: DOI
Kobayashi, Yasuaki; Tamaki, Hisao A faster fixed parameter algorithm for two-layer crossing minimization. (English) Zbl 1358.68224 Inf. Process. Lett. 116, No. 9, 547-549 (2016). MSC: 68R10 05C85 68Q25 PDFBibTeX XMLCite \textit{Y. Kobayashi} and \textit{H. Tamaki}, Inf. Process. Lett. 116, No. 9, 547--549 (2016; Zbl 1358.68224) Full Text: DOI arXiv
Haddadi, S.; Chenche, S.; Cheraitia, M.; Guessoum, F. Polynomial-time local-improvement algorithm for consecutive block minimization. (English) Zbl 1328.68302 Inf. Process. Lett. 115, No. 6-8, 612-617 (2015). MSC: 68W25 68Q25 PDFBibTeX XMLCite \textit{S. Haddadi} et al., Inf. Process. Lett. 115, No. 6--8, 612--617 (2015; Zbl 1328.68302) Full Text: DOI
Čepek, Ondřej; Kučera, Petr; Kuřík, Stanislav Boolean functions with long prime implicants. (English) Zbl 1285.06006 Inf. Process. Lett. 113, No. 19-21, 698-703 (2013). MSC: 06E30 68W25 68W40 94C10 PDFBibTeX XMLCite \textit{O. Čepek} et al., Inf. Process. Lett. 113, No. 19--21, 698--703 (2013; Zbl 1285.06006) Full Text: DOI
Kolliopoulos, Stavros G.; Moysoglou, Yannis The 2-valued case of makespan minimization with assignment constraints. (English) Zbl 1259.68238 Inf. Process. Lett. 113, No. 1-2, 39-43 (2013). MSC: 68W25 90B35 PDFBibTeX XMLCite \textit{S. G. Kolliopoulos} and \textit{Y. Moysoglou}, Inf. Process. Lett. 113, No. 1--2, 39--43 (2013; Zbl 1259.68238) Full Text: DOI arXiv
Morizumi, Hiroki Improved approximation algorithms for minimum AND-circuits problem via \(k\)-set cover. (English) Zbl 1260.68160 Inf. Process. Lett. 111, No. 5, 218-221 (2011). MSC: 68Q17 68Q25 68W25 94C10 PDFBibTeX XMLCite \textit{H. Morizumi}, Inf. Process. Lett. 111, No. 5, 218--221 (2011; Zbl 1260.68160) Full Text: DOI
Fredriksson, Kimmo On building minimal automaton for subset matching queries. (English) Zbl 1379.68371 Inf. Process. Lett. 110, No. 24, 1093-1098 (2010). MSC: 68W32 68P20 68Q45 PDFBibTeX XMLCite \textit{K. Fredriksson}, Inf. Process. Lett. 110, No. 24, 1093--1098 (2010; Zbl 1379.68371) Full Text: DOI arXiv
Haddadi, Salim; Layouni, Zoubir Consecutive block minimization is 1.5-approximable. (English) Zbl 1191.68865 Inf. Process. Lett. 108, No. 3, 132-135 (2008). MSC: 68W25 PDFBibTeX XMLCite \textit{S. Haddadi} and \textit{Z. Layouni}, Inf. Process. Lett. 108, No. 3, 132--135 (2008; Zbl 1191.68865) Full Text: DOI
Almeida, Jorge; Zeitoun, Marc Description and analysis of a bottom-up DFA minimization algorithm. (English) Zbl 1186.68242 Inf. Process. Lett. 107, No. 2, 52-59 (2008). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Almeida} and \textit{M. Zeitoun}, Inf. Process. Lett. 107, No. 2, 52--59 (2008; Zbl 1186.68242) Full Text: DOI
Hierons, R. M. Using a minimal number of resets when testing from a finite state machine. (English) Zbl 1178.68316 Inf. Process. Lett. 90, No. 6, 287-292 (2004). MSC: 68Q45 PDFBibTeX XMLCite \textit{R. M. Hierons}, Inf. Process. Lett. 90, No. 6, 287--292 (2004; Zbl 1178.68316) Full Text: DOI Link
Löding, C. Efficient minimization of deterministic weak \(\omega\)-automata. (English) Zbl 1032.68103 Inf. Process. Lett. 79, No. 3, 105-109 (2001). MSC: 68Q60 PDFBibTeX XMLCite \textit{C. Löding}, Inf. Process. Lett. 79, No. 3, 105--109 (2001; Zbl 1032.68103) Full Text: DOI
Shimozono, Shinichi; Hirata, Kouichi; Shinohara, Ayumi On the hardness of approximating the minimum consistent acyclic DFA and decision diagram. (English) Zbl 1078.68642 Inf. Process. Lett. 66, No. 4, 165-170 (1998). MSC: 68Q25 68Q45 PDFBibTeX XMLCite \textit{S. Shimozono} et al., Inf. Process. Lett. 66, No. 4, 165--170 (1998; Zbl 1078.68642) Full Text: DOI
Blum, Norbert An O(n log n) implementation of the standard method for minimizing n-state finite automata. (English) Zbl 0875.68649 Inf. Process. Lett. 57, No. 2, 65-69 (1996). MSC: 68Q45 68W10 PDFBibTeX XMLCite \textit{N. Blum}, Inf. Process. Lett. 57, No. 2, 65--69 (1996; Zbl 0875.68649) Full Text: DOI
Leung, Joseph Y.-T.; Wei, W.-D. Tighter bounds on a heuristic for a partition problem. (English) Zbl 0875.68460 Inf. Process. Lett. 56, No. 1, 51-57 (1995). MSC: 68W10 PDFBibTeX XMLCite \textit{J. Y. T. Leung} and \textit{W. D. Wei}, Inf. Process. Lett. 56, No. 1, 51--57 (1995; Zbl 0875.68460) Full Text: DOI
Cheng, Eddie; Cunningham, William H. A faster algorithm for computing the strength of a network. (English) Zbl 0795.68152 Inf. Process. Lett. 49, No. 4, 209-212 (1994). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{E. Cheng} and \textit{W. H. Cunningham}, Inf. Process. Lett. 49, No. 4, 209--212 (1994; Zbl 0795.68152) Full Text: DOI
Teo, Kim-Heng; Tuan, Tai-Ching Performance analysis of greedy heuristic to find a minimum total-jogs layout for river routing. (English) Zbl 0704.68060 Inf. Process. Lett. 36, No. 4, 167-170 (1990). MSC: 68Q25 94C99 68W10 PDFBibTeX XMLCite \textit{K.-H. Teo} and \textit{T.-C. Tuan}, Inf. Process. Lett. 36, No. 4, 167--170 (1990; Zbl 0704.68060) Full Text: DOI