Dresher Feit, Sidnie A fast algorithm for the two-variable integer programming problem. (English) Zbl 0642.90075 J. Assoc. Comput. Mach. 31, 99-113 (1984). Reviewer: J.Piehler MSC: 90C10 68Q25 65K05 PDF BibTeX XML Cite \textit{S. Dresher Feit}, J. Assoc. Comput. Mach. 31, 99--113 (1984; Zbl 0642.90075) Full Text: DOI
Simon, B. Priority queues with feedback. (English) Zbl 0642.60094 J. Assoc. Comput. Mach. 31, 134-149 (1984). MSC: 60K25 90B22 PDF BibTeX XML Cite \textit{B. Simon}, J. Assoc. Comput. Mach. 31, 134--149 (1984; Zbl 0642.60094) Full Text: DOI
Boxma, O. J.; Kelly, F. P.; Konheim, A. G. The product form for sojourn time distributions in cyclic exponential queues. (English) Zbl 0642.60073 J. Assoc. Comput. Mach. 31, 128-133 (1984). MSC: 60K20 60K25 PDF BibTeX XML Cite \textit{O. J. Boxma} et al., J. Assoc. Comput. Mach. 31, 128--133 (1984; Zbl 0642.60073) Full Text: DOI
McKenna, J.; Mitra, Debasis Asymptotic expansions and integral representations of moments of queue lengths in closed Markovian networks. (English) Zbl 0638.60102 J. Assoc. Comput. Mach. 31, 346-360 (1984). Reviewer: W.Schlee-Kössler MSC: 60K25 90B22 68M20 PDF BibTeX XML Cite \textit{J. McKenna} and \textit{D. Mitra}, J. Assoc. Comput. Mach. 31, 346--360 (1984; Zbl 0638.60102) Full Text: DOI
Megiddo, Nimrod Linear programming in linear time when the dimension is fixed. (English) Zbl 0637.90064 J. Assoc. Comput. Mach. 31, 114-127 (1984). MSC: 90C05 68Q25 PDF BibTeX XML Cite \textit{N. Megiddo}, J. Assoc. Comput. Mach. 31, 114--127 (1984; Zbl 0637.90064) Full Text: DOI
Lazar, Aurel A. Optimal flow control of an M/M/m queue. (English) Zbl 0637.90042 J. Assoc. Comput. Mach. 31, 86-98 (1984). MSC: 90B22 60K25 PDF BibTeX XML Cite \textit{A. A. Lazar}, J. Assoc. Comput. Mach. 31, 86--98 (1984; Zbl 0637.90042) Full Text: DOI
Greene, Jonathan W.; El Gamal, Abbas Configuation of VLSI arrays in the presence of defects. (English) Zbl 0632.94033 J. Assoc. Comput. Mach. 31, 694-717 (1984). MSC: 94C15 94C10 68M20 PDF BibTeX XML Cite \textit{J. W. Greene} and \textit{A. El Gamal}, J. Assoc. Comput. Mach. 31, 694--717 (1984; Zbl 0632.94033) Full Text: DOI
Beeri, Catriel; Vardi, Moshe Y. A proof procedure for data dependencies. (English) Zbl 0632.68097 J. Assoc. Comput. Mach. 31, 718-741 (1984). MSC: 68P20 68T15 PDF BibTeX XML Cite \textit{C. Beeri} and \textit{M. Y. Vardi}, J. Assoc. Comput. Mach. 31, 718--741 (1984; Zbl 0632.68097) Full Text: DOI
Cosmadakis, Stavros S.; Papadimitriou, Christos H. Updates of relational views. (English) Zbl 0632.68095 J. Assoc. Comput. Mach. 31, 742-760 (1984). MSC: 68P20 PDF BibTeX XML Cite \textit{S. S. Cosmadakis} and \textit{C. H. Papadimitriou}, J. Assoc. Comput. Mach. 31, 742--760 (1984; Zbl 0632.68095) Full Text: DOI
Imieliński, Tomasz; Lipski, Witold jun. Incomplete information in relational databases. (English) Zbl 0632.68094 J. Assoc. Comput. Mach. 31, 761-791 (1984). MSC: 68P20 PDF BibTeX XML Cite \textit{T. Imieliński} and \textit{W. Lipski jun.}, J. Assoc. Comput. Mach. 31, 761--791 (1984; Zbl 0632.68094) Full Text: DOI
Culik, Karel II; Harju, Tero The \(\omega\)-sequence equivalence problem for D0L systems is decidable. (English) Zbl 0632.68078 J. Assoc. Comput. Mach. 31, 282-298 (1984). MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{K. Culik II} and \textit{T. Harju}, J. Assoc. Comput. Mach. 31, 282--298 (1984; Zbl 0632.68078) Full Text: DOI
Williamson, S. G. Depth-first search and Kuratowski subgraphs. (English) Zbl 0632.68063 J. Assoc. Comput. Mach. 31, 681-693 (1984). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{S. G. Williamson}, J. Assoc. Comput. Mach. 31, 681--693 (1984; Zbl 0632.68063) Full Text: DOI
Reif, John H. Symmetric complementation. (English) Zbl 0632.68062 J. Assoc. Comput. Mach. 31, 401-421 (1984). MSC: 68R10 68Q25 91A80 PDF BibTeX XML Cite \textit{J. H. Reif}, J. Assoc. Comput. Mach. 31, 401--421 (1984; Zbl 0632.68062) Full Text: DOI
Hunt, H. B. III Terminating Turing machine computations and the complexity and/or decidability of correspondence problems, grammars, and program schemes. (English) Zbl 0632.68048 J. Assoc. Comput. Mach. 31, 299-318 (1984). MSC: 68Q25 68Q05 68Q45 68Q60 PDF BibTeX XML Cite \textit{H. B. Hunt III}, J. Assoc. Comput. Mach. 31, 299--318 (1984; Zbl 0632.68048) Full Text: DOI
Tarjan, Robert E.; van Leeuwen, Jan Worst-case analysis of set union algorithms. (English) Zbl 0632.68043 J. Assoc. Comput. Mach. 31, 245-281 (1984). MSC: 68Q25 68R99 68R10 PDF BibTeX XML Cite \textit{R. E. Tarjan} and \textit{J. van Leeuwen}, J. Assoc. Comput. Mach. 31, 245--281 (1984; Zbl 0632.68043) Full Text: DOI
Savage, John E. Space-time trade-offs for banded matrix problems. (English) Zbl 0632.68040 J. Assoc. Comput. Mach. 31, 422-437 (1984). MSC: 68Q25 65F05 PDF BibTeX XML Cite \textit{J. E. Savage}, J. Assoc. Comput. Mach. 31, 422--437 (1984; Zbl 0632.68040) Full Text: DOI
Röck, Hans The three-machine no-wait flow shop is NP-complete. (English) Zbl 0632.68038 J. Assoc. Comput. Mach. 31, 336-345 (1984). MSC: 68M20 68Q25 90B35 PDF BibTeX XML Cite \textit{H. Röck}, J. Assoc. Comput. Mach. 31, 336--345 (1984; Zbl 0632.68038) Full Text: DOI
Yannakakis, Mihalis Serializability by locking. (English) Zbl 0631.68078 J. Assoc. Comput. Mach. 31, 227-244 (1984). MSC: 68P20 68N25 PDF BibTeX XML Cite \textit{M. Yannakakis}, J. Assoc. Comput. Mach. 31, 227--244 (1984; Zbl 0631.68078) Full Text: DOI
Hull, Richard Finitely specifiable implicational dependency families. (English) Zbl 0631.68077 J. Assoc. Comput. Mach. 31, 210-226 (1984). MSC: 68P20 PDF BibTeX XML Cite \textit{R. Hull}, J. Assoc. Comput. Mach. 31, 210--226 (1984; Zbl 0631.68077) Full Text: DOI
Gottlieb, Allan; Kruśkal, Clyde P. Complexity results for permuting data and other computations on parallel processors. (English) Zbl 0631.68045 J. Assoc. Comput. Mach. 31, 193-209 (1984). MSC: 68Q25 PDF BibTeX XML Cite \textit{A. Gottlieb} and \textit{C. P. Kruśkal}, J. Assoc. Comput. Mach. 31, 193--209 (1984; Zbl 0631.68045) Full Text: DOI
Ja’ja’, Joseph The VLSI complexity of selected graph problems. (English) Zbl 0631.68039 J. Assoc. Comput. Mach. 31, 377-391 (1984). MSC: 68Q25 68R10 PDF BibTeX XML Cite \textit{J. Ja'ja'}, J. Assoc. Comput. Mach. 31, 377--391 (1984; Zbl 0631.68039) Full Text: DOI
Papdimitriou, Christos H. On the complexity of unique solutions. (English) Zbl 0631.68038 J. Assoc. Comput. Mach. 31, 392-400 (1984). MSC: 68Q25 90C35 PDF BibTeX XML Cite \textit{C. H. Papdimitriou}, J. Assoc. Comput. Mach. 31, 392--400 (1984; Zbl 0631.68038) Full Text: DOI
Meyer auf der Heide, Friedhelm A polynomial linear search algorithm for the \(n\)-dimensional knapsack problem. (English) Zbl 0631.68037 J. Assoc. Comput. Mach. 31, 668-676 (1984). MSC: 68Q25 90C05 PDF BibTeX XML Cite \textit{F. Meyer auf der Heide}, J. Assoc. Comput. Mach. 31, 668--676 (1984; Zbl 0631.68037) Full Text: DOI
Adachi, Akeo; Iwata, Shigeki; Kasai, Takumi Some combinatorial game problems require \(\Omega (n^ k)\) time. (English) Zbl 0631.68036 J. Assoc. Comput. Mach. 31, 361-376 (1984). MSC: 68Q25 PDF BibTeX XML Cite \textit{A. Adachi} et al., J. Assoc. Comput. Mach. 31, 361--376 (1984; Zbl 0631.68036) Full Text: DOI
Hull, Richard; Yap, Chee K. The format model: A theory of database organization. (English) Zbl 0629.68098 J. Assoc. Comput. Mach. 31, 518-537 (1984). MSC: 68P20 68P05 PDF BibTeX XML Cite \textit{R. Hull} and \textit{C. K. Yap}, J. Assoc. Comput. Mach. 31, 518--537 (1984; Zbl 0629.68098) Full Text: DOI
Beeri, Catriel; Dowd, Martin; Fagin, Ronald; Statman, Richard On the structure of Armstrong relations for functional dependencies. (English) Zbl 0629.68096 J. Assoc. Comput. Mach. 31, 30-46 (1984). MSC: 68P20 PDF BibTeX XML Cite \textit{C. Beeri} et al., J. Assoc. Comput. Mach. 31, 30--46 (1984; Zbl 0629.68096) Full Text: DOI
Henschen, Lawrence J.; Naqvi, Shamim A. On compiling queries in recursive first-order databases. (English) Zbl 0629.68095 J. Assoc. Comput. Mach. 31, 47-85 (1984). MSC: 68P20 68T15 68Q65 PDF BibTeX XML Cite \textit{L. J. Henschen} and \textit{S. A. Naqvi}, J. Assoc. Comput. Mach. 31, 47--85 (1984; Zbl 0629.68095) Full Text: DOI
Shostak, Robert E. Deciding combinations of theories. (English) Zbl 0629.68089 J. Assoc. Comput. Mach. 31, 1-12 (1984). MSC: 68T15 68Q60 03B35 PDF BibTeX XML Cite \textit{R. E. Shostak}, J. Assoc. Comput. Mach. 31, 1--12 (1984; Zbl 0629.68089) Full Text: DOI
Boyer, Robert S.; Moore, J. Strother A mechanical proof of the unsolvability of the halting problem. (English) Zbl 0629.68088 J. Assoc. Comput. Mach. 31, 441-458 (1984). MSC: 68T15 PDF BibTeX XML Cite \textit{R. S. Boyer} and \textit{J. S. Moore}, J. Assoc. Comput. Mach. 31, 441--458 (1984; Zbl 0629.68088) Full Text: DOI
Atallah, Mikhail J.; Kosaraju, S. Rao Graph problems on a mesh-connected processor array. (English) Zbl 0629.68073 J. Assoc. Comput. Mach. 31, 649-667 (1984). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{M. J. Atallah} and \textit{S. R. Kosaraju}, J. Assoc. Comput. Mach. 31, 649--667 (1984; Zbl 0629.68073) Full Text: DOI
Fredman, Michael L.; Komlós, János; Szemerédi, Endre Storing a sparse table with O(1) worst case access time. (English) Zbl 0629.68068 J. Assoc. Comput. Mach. 31, 538-544 (1984). MSC: 68P10 68Q25 PDF BibTeX XML Cite \textit{M. L. Fredman} et al., J. Assoc. Comput. Mach. 31, 538--544 (1984; Zbl 0629.68068) Full Text: DOI
Datta, Ajoy; Ghosh, S. Synthesis of a class of deadlock-free Petri nets. (English) Zbl 0629.68066 J. Assoc. Comput. Mach. 31, 486-506 (1984). MSC: 68Q85 PDF BibTeX XML Cite \textit{A. Datta} and \textit{S. Ghosh}, J. Assoc. Comput. Mach. 31, 486--506 (1984; Zbl 0629.68066) Full Text: DOI
Gurevich, Yuri; Stockmeyer, Larry; Vishkin, Uzi Solving NP-hard problems on graphs that are almost trees and an application to facility location problems. (English) Zbl 0629.68042 J. Assoc. Comput. Mach. 31, 459-473 (1984). MSC: 68Q25 68R10 PDF BibTeX XML Cite \textit{Y. Gurevich} et al., J. Assoc. Comput. Mach. 31, 459--473 (1984; Zbl 0629.68042) Full Text: DOI
Hofri, Micha Analysis of interleaved storage via a constant-service queuing system with Markov-chain-driven input. (English) Zbl 0629.68036 J. Assoc. Comput. Mach. 31, 628-648 (1984). MSC: 68M20 PDF BibTeX XML Cite \textit{M. Hofri}, J. Assoc. Comput. Mach. 31, 628--648 (1984; Zbl 0629.68036) Full Text: DOI
Calderbank, A. R.; Coffman, E. G. jun.; Flatto, L. Optimum head separation in a disk system with two read/write heads. (English) Zbl 0629.68030 J. Assoc. Comput. Mach. 31, 826-838 (1984). MSC: 68N25 PDF BibTeX XML Cite \textit{A. R. Calderbank} et al., J. Assoc. Comput. Mach. 31, 826--838 (1984; Zbl 0629.68030) Full Text: DOI
Mitra, Debasis; Weinberger, P. J. Probabilistic models of database locking: Solutions, computational algorithms, and asymptotics. (English) Zbl 0628.68078 J. Assoc. Comput. Mach. 31, 855-878 (1984). MSC: 68P15 68N25 68M20 PDF BibTeX XML Cite \textit{D. Mitra} and \textit{P. J. Weinberger}, J. Assoc. Comput. Mach. 31, 855--878 (1984; Zbl 0628.68078) Full Text: DOI
Pachl, J.; Korach, E.; Rotem, D. Lower bounds for distributed maximum-fiding algorithms. (English) Zbl 0628.68046 J. Assoc. Comput. Mach. 31, 905-918 (1984). MSC: 68Q25 68N25 PDF BibTeX XML Cite \textit{J. Pachl} et al., J. Assoc. Comput. Mach. 31, 905--918 (1984; Zbl 0628.68046) Full Text: DOI
Bloniarz, P. A.; Hunt, H. B. III; Rosenkrantz, D. J. Algebraic structures with hard equivalence and minimization problems. (English) Zbl 0628.68039 J. Assoc. Comput. Mach. 31, 879-904 (1984). MSC: 68W30 68Q25 PDF BibTeX XML Cite \textit{P. A. Bloniarz} et al., J. Assoc. Comput. Mach. 31, 879--904 (1984; Zbl 0628.68039) Full Text: DOI
Melamed, Benjamin; Yadin, Micha Numerical computation of sojourn-time distributions in queuing networks. (English) Zbl 0628.68037 J. Assoc. Comput. Mach. 31, 839-854 (1984). MSC: 68M20 60K20 PDF BibTeX XML Cite \textit{B. Melamed} and \textit{M. Yadin}, J. Assoc. Comput. Mach. 31, 839--854 (1984; Zbl 0628.68037) Full Text: DOI
Brookes, S. D.; Hoare, C. A. R.; Roscoe, A. W. A theory of communicating sequential processes. (English) Zbl 0628.68025 J. Assoc. Comput. Mach. 31, 560-599 (1984). MSC: 68N25 PDF BibTeX XML Cite \textit{S. D. Brookes} et al., J. Assoc. Comput. Mach. 31, 560--599 (1984; Zbl 0628.68025) Full Text: DOI
Upfal, Eli Efficient schemes for parallel communication. (English) Zbl 0628.68021 J. Assoc. Comput. Mach. 31, 507-517 (1984). MSC: 68N25 PDF BibTeX XML Cite \textit{E. Upfal}, J. Assoc. Comput. Mach. 31, 507--517 (1984; Zbl 0628.68021) Full Text: DOI
Baccelli, François; Gelenbe, Erol; Plateau, Brigitte An end-to-end approach to the resequencing problem. (English) Zbl 0628.68020 J. Assoc. Comput. Mach. 31, 474-485 (1984). MSC: 68N25 PDF BibTeX XML Cite \textit{F. Baccelli} et al., J. Assoc. Comput. Mach. 31, 474--485 (1984; Zbl 0628.68020) Full Text: DOI
McLean, John A formal method for the abstract specification of software. (English) Zbl 0628.68013 J. Assoc. Comput. Mach. 31, 600-627 (1984). MSC: 68Q60 68Q65 PDF BibTeX XML Cite \textit{J. McLean}, J. Assoc. Comput. Mach. 31, 600--627 (1984; Zbl 0628.68013) Full Text: DOI
Clenshaw, C. W.; Olver, F. W. J. Beyond floating point. (English) Zbl 0628.65037 J. Assoc. Comput. Mach. 31, 319-328 (1984). MSC: 65G50 68P05 PDF BibTeX XML Cite \textit{C. W. Clenshaw} and \textit{F. W. J. Olver}, J. Assoc. Comput. Mach. 31, 319--328 (1984; Zbl 0628.65037) Full Text: DOI
Courtois, P.-J.; Semal, P. Bounds for the positive eigenvectors of nonnegative matrices and for their approximations by decomposition. (English) Zbl 0628.65029 J. Assoc. Comput. Mach. 31, 804-825 (1984). MSC: 65F15 15A42 15B48 15B51 PDF BibTeX XML Cite \textit{P. J. Courtois} and \textit{P. Semal}, J. Assoc. Comput. Mach. 31, 804--825 (1984; Zbl 0628.65029) Full Text: DOI
Traub, J. F.; Woźniakowski, H. On the optimal solution of large linear systems. (English) Zbl 0628.65026 J. Assoc. Comput. Mach. 31, 545-559 (1984). MSC: 65F10 65F35 PDF BibTeX XML Cite \textit{J. F. Traub} and \textit{H. Woźniakowski}, J. Assoc. Comput. Mach. 31, 545--559 (1984; Zbl 0628.65026) Full Text: DOI
Trojan, George M. Lower bounds and fast algorithms for sequence acceleration. (English) Zbl 0628.65002 J. Assoc. Comput. Mach. 31, 329-335 (1984). MSC: 65B05 PDF BibTeX XML Cite \textit{G. M. Trojan}, J. Assoc. Comput. Mach. 31, 329--335 (1984; Zbl 0628.65002) Full Text: DOI
Bojańczyk, A. Optimal asynchronous Newton method for the solution of nonlinear equations. (English) Zbl 0627.65049 J. Assoc. Comput. Mach. 31, 792-803 (1984). MSC: 65H10 65Y05 PDF BibTeX XML Cite \textit{A. Bojańczyk}, J. Assoc. Comput. Mach. 31, 792--803 (1984; Zbl 0627.65049) Full Text: DOI
Hoover, H. J.; Klawe, M. M.; Pippenger, N. J. Bounding fan-out in logical networks. (English) Zbl 0626.94015 J. Assoc. Comput. Mach. 31, 13-18 (1984). MSC: 94C10 PDF BibTeX XML Cite \textit{H. J. Hoover} et al., J. Assoc. Comput. Mach. 31, 13--18 (1984; Zbl 0626.94015) Full Text: DOI
Eades, Peter; Hickey, Michael; Read, Ronald C. Some Hamilton paths and a minimal change algorithm. (English) Zbl 0625.68046 J. Assoc. Comput. Mach. 31, 19-29 (1984). MSC: 68R10 05A05 05C38 PDF BibTeX XML Cite \textit{P. Eades} et al., J. Assoc. Comput. Mach. 31, 19--29 (1984; Zbl 0625.68046) Full Text: DOI
Smith, Douglas R. Random trees and the analysis of branch and bound procedures. (English) Zbl 0625.68032 J. Assoc. Comput. Mach. 31, 163-188 (1984). MSC: 68Q25 68P10 90C35 PDF BibTeX XML Cite \textit{D. R. Smith}, J. Assoc. Comput. Mach. 31, 163--188 (1984; Zbl 0625.68032) Full Text: DOI
Ja’ja’, Joseph; Prasanna Kumar, V. K. Information transfer in distributed computing with applications to VLSI. (English) Zbl 0625.68030 J. Assoc. Comput. Mach. 31, 150-162 (1984). MSC: 68Q25 PDF BibTeX XML Cite \textit{J. Ja'ja'} and \textit{V. K. Prasanna Kumar}, J. Assoc. Comput. Mach. 31, 150--162 (1984; Zbl 0625.68030) Full Text: DOI