Bini, Dario; Pan, Victor Ya. Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power. (English) Zbl 0608.65026 Inf. Process. Lett. 21, 79-81 (1985). Reviewer: F.Ribière-Michaud MSC: 65H05 65F05 12D05 × Cite Format Result Cite Review PDF Full Text: DOI
Marchetti-Spaccamela, A.; Romano, G. On different approximation criteria for subset product problems. (English) Zbl 0593.90056 Inf. Process. Lett. 21, 213-218 (1985). MSC: 90C10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Martin, Alain J.; Burch, Jerry R. Fair mutual exclusion with unfair P and V operations. (English) Zbl 0593.68018 Inf. Process. Lett. 21, 97-100 (1985). MSC: 68N25 × Cite Format Result Cite Review PDF Full Text: DOI Link
Codenotti, B.; Romani, F.; Lotti, G. VLSI implementation of fast solvers for band linear systems with constant coefficient matrix. (English) Zbl 0591.65025 Inf. Process. Lett. 21, 159-163 (1985). MSC: 65F05 65F30 65T40 × Cite Format Result Cite Review PDF Full Text: DOI
Guralnik, Gerald; Zemach, Charles; Warnock, Tony An algorithm for uniform random sampling of points in and on a hypersphere. (English) Zbl 0591.65006 Inf. Process. Lett. 21, 17-21 (1985). Reviewer: W.Schlee MSC: 65C10 65C05 × Cite Format Result Cite Review PDF Full Text: DOI
Lautemann, Clemens; Meyer auf der Heide, Friedhelm Lower time bounds for integer programming with two variables. (English) Zbl 0587.90072 Inf. Process. Lett. 21, 101-105 (1985). Reviewer: H.Suzuki MSC: 90C10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Derigs, Ulrich An efficient Dijkstra-like labeling method for computing shortest odd/even paths. (English) Zbl 0587.05043 Inf. Process. Lett. 21, 253-258 (1985). Reviewer: M. Křivánek MSC: 05C38 05C70 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Birkhoff, Ingrid J. M. A direct routing algorithm for the bit-reversal permutation on a shuffle- exchange network. (English) Zbl 0586.68055 Inf. Process. Lett. 21, 259-268 (1985). MSC: 68R10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Magott, Jan Performance evaluation of systems of cyclic sequential processes with mutual exclusion using Petri nets. (English) Zbl 0586.68052 Inf. Process. Lett. 21, 229-232 (1985). MSC: 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI
Supowit, Kenneth J. Decomposing a set of points into chains, with applications to permutation and circle graphs. (English) Zbl 0586.68034 Inf. Process. Lett. 21, 249-252 (1985). MSC: 68Q25 68R10 05C15 × Cite Format Result Cite Review PDF Full Text: DOI
Ďuriš, Pavol; Sýkora, Ondrej; Vrťo, Imrich; Thompson, Clark D. Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations. (English) Zbl 0586.68033 Inf. Process. Lett. 21, 245-247 (1985). MSC: 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Laumond, Jean-Paul Enumeration of articulation pairs of a planar graph. (English) Zbl 0585.05006 Inf. Process. Lett. 21, 173-179 (1985). Reviewer: M.M.Sysło MSC: 05C10 05C30 05C40 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Janiga, Ladislav; Koubek, Vaclav A note on finding minimum cuts in directed planar networks by parallel computations. (English) Zbl 0583.90026 Inf. Process. Lett. 21, 75-78 (1985). Reviewer: P.Brucker MSC: 90B10 90C35 05C35 × Cite Format Result Cite Review PDF Full Text: DOI
Edelsbrunner, H.; Maurer, H. A. Finding extreme points in three dimensions and solving the post-office problem in the plane. (English) Zbl 0583.90023 Inf. Process. Lett. 21, 39-47 (1985). Reviewer: K.Mosler MSC: 90B05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Kothari, Suresh C.; Ramarao, K. V. S. General algorithms for the address calculation of lexicographically ordered tuples. (English) Zbl 0582.68039 Inf. Process. Lett. 21, 113-116 (1985). MSC: 68R99 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Herman, Ted; Chandy, K. Mani On distributed search. (English) Zbl 0582.68037 Inf. Process. Lett. 21, 129-133 (1985). MSC: 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Lee, D. T.; Ching, Y. T. The power of geometric duality revisited. (English) Zbl 0582.68032 Inf. Process. Lett. 21, 117-122 (1985). MSC: 68P10 68U99 × Cite Format Result Cite Review PDF Full Text: DOI
Vitányi, Paul M. B. An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape. (English) Zbl 0582.68019 Inf. Process. Lett. 21, 147-152 (1985). MSC: 68Q05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Ja’ja’, Joseph; Takche, Jean Improved lower bounds for some matrix multiplication problems. (English) Zbl 0582.68013 Inf. Process. Lett. 21, 123-127 (1985). MSC: 68Q25 68W30 × Cite Format Result Cite Review PDF Full Text: DOI
Hromkovič, Juraj Linear lower bounds on unbounded fan-in Boolean circuits. (English) Zbl 0581.94026 Inf. Process. Lett. 21, 71-74 (1985). MSC: 94C10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Jantzen, M. A note on a special one-rule semi-Thue system. (English) Zbl 0581.68030 Inf. Process. Lett. 21, 135-140 (1985). MSC: 68-01 68W30 03D03 03D40 × Cite Format Result Cite Review PDF Full Text: DOI
Kfoury, A. J. The unwind property for programs with bounded memory. (English) Zbl 0581.68012 Inf. Process. Lett. 21, 233-238 (1985). MSC: 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Hromkovič, Juraj Alternating multicounter machines with constant number of reversals. (English) Zbl 0579.68033 Inf. Process. Lett. 21, 7-9 (1985). MSC: 68Q05 68Q25 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI
Negri, M.; Pelagatti, G. Join during merge: an improved sort based algorithm. (English) Zbl 0578.68087 Inf. Process. Lett. 21, 11-16 (1985). MSC: 68P20 68P05 × Cite Format Result Cite Review PDF Full Text: DOI Link
Robert, Yves; Tchuente, Maurice A systolic array for the longest common subsequence problem. (English) Zbl 0578.68066 Inf. Process. Lett. 21, 191-198 (1985). MSC: 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI
Budd, Timothy A. Creation and reflexive rights in grammatical protection systems. (English) Zbl 0578.68027 Inf. Process. Lett. 21, 141-145 (1985). MSC: 68N25 × Cite Format Result Cite Review PDF Full Text: DOI
Wegener, Ingo Optimal search with positive switch cost is NP-hard. (English) Zbl 0577.90041 Inf. Process. Lett. 21, 49-52 (1985). MSC: 90B40 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Güting, Ralf Hartmut Fast dynamic intersection searching in a set of isothetic line segments. (English) Zbl 0577.68069 Inf. Process. Lett. 21, 165-171 (1985). MSC: 68R99 68P10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Hsiao, Ching C.; Shen, Nien-Tsu k-fold bitonic sort on a mesh-connected parallel computer. (English) Zbl 0577.68068 Inf. Process. Lett. 21, 207-212 (1985). MSC: 68P10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Oh, Se Man; Park, J. C. H. A note on removing loops from table-driven code generators. (English) Zbl 0575.68088 Inf. Process. Lett. 21, 31-38 (1985). MSC: 68N20 × Cite Format Result Cite Review PDF Full Text: DOI
Wätjen, Dietmar Feedback automata and their languages. (English) Zbl 0575.68084 Inf. Process. Lett. 21, 83-86 (1985). MSC: 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI
Lumelsky, Vladimir J. On fast computation of distance between line segments. (English) Zbl 0575.68076 Inf. Process. Lett. 21, 55-61 (1985). MSC: 68R99 × Cite Format Result Cite Review PDF Full Text: DOI
Kaldewaij, Anne On the decomposition of sequences into ascending subsequences. (English) Zbl 0575.68074 Inf. Process. Lett. 21, 69 (1985). MSC: 68R99 68N99 × Cite Format Result Cite Review PDF Full Text: DOI
Vitányi, Paul M. B. Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit. (English) Zbl 0575.68051 Inf. Process. Lett. 21, 87-91 (1985). MSC: 68Q05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI Link
Alpern, Bowen; Schneider, Fred B. Defining liveness. (English) Zbl 0575.68030 Inf. Process. Lett. 21, 181-185 (1985). MSC: 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI
Nguyen, Van The incompleteness of Misra and Chandy’s proof systems. (English) Zbl 0575.68022 Inf. Process. Lett. 21, 93-96 (1985). MSC: 68N25 68Q65 × Cite Format Result Cite Review PDF Full Text: DOI Link
Räuchle, Thomas; Toueg, Sam Exposure to deadlock for communicating processes is hard to detect. (English) Zbl 0575.68021 Inf. Process. Lett. 21, 63-68 (1985). MSC: 68N25 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI
Kapur, Deepak; Krishnamoorthy, Mukkai S. Worst-case choice for the stable marriage problem. (English) Zbl 0574.05039 Inf. Process. Lett. 21, 27-30 (1985). MSC: 05C70 68R10 05A05 × Cite Format Result Cite Review PDF Full Text: DOI
Atkinson, M. D. On zigzag permutations and comparisons of adjacent elements. (English) Zbl 0573.05002 Inf. Process. Lett. 21, 187-189 (1985). MSC: 05A05 05A15 × Cite Format Result Cite Review PDF Full Text: DOI
Yokomori, Takashi; Wood, Derick; Lange, Klaus-Jörn Erratum to: “A three-restricted normal form theorem for ETOL languages. (English) Zbl 0571.68060 Inf. Process. Lett. 21, 53 (1985). MSC: 68Q45 68Q42 × Cite Format Result Cite Review PDF Full Text: DOI