Calude, Cristian S.; Jain, Sanjay; Khoussainov, Bakhadyr; Li, Wei; Stephan, Frank Deciding parity games in quasi-polynomial time. (English) Zbl 07516621 SIAM J. Comput. 51, No. 2, STOC17-152-STOC17-188 (2022). MSC: 68Q25 68Q70 PDFBibTeX XMLCite \textit{C. S. Calude} et al., SIAM J. Comput. 51, No. 2, STOC17--152-STOC17--188 (2022; Zbl 07516621) Full Text: DOI
Iwata, Satoru; Kobayashi, Yusuke A weighted linear matroid parity algorithm. (English) Zbl 1459.90181 SIAM J. Comput. 51, No. 2, STOC17-238-STOC17-280 (2021). MSC: 90C27 PDFBibTeX XMLCite \textit{S. Iwata} and \textit{Y. Kobayashi}, SIAM J. Comput. 51, No. 2, STOC17--238-STOC17--280 (2021; Zbl 1459.90181) Full Text: DOI
Etessami, Kousha; Stewart, Alistair; Yannakakis, Mihalis A polynomial time algorithm for computing extinction probabilities of multitype branching processes. (English) Zbl 1378.68074 SIAM J. Comput. 46, No. 5, 1515-1553 (2017). MSC: 68Q25 60G07 60J80 68Q42 68Q87 68W25 PDFBibTeX XMLCite \textit{K. Etessami} et al., SIAM J. Comput. 46, No. 5, 1515--1553 (2017; Zbl 1378.68074) Full Text: DOI
Grochow, Joshua A.; Qiao, Youming Algorithms for group isomorphism via group extensions and cohomology. (English) Zbl 1475.20001 SIAM J. Comput. 46, No. 4, 1153-1216 (2017). MSC: 20-08 68W30 68Q25 PDFBibTeX XMLCite \textit{J. A. Grochow} and \textit{Y. Qiao}, SIAM J. Comput. 46, No. 4, 1153--1216 (2017; Zbl 1475.20001) Full Text: DOI arXiv
Végh, László A. A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives. (English) Zbl 1410.91327 SIAM J. Comput. 45, No. 5, 1729-1761 (2016). MSC: 91B50 90C20 90C25 68Q10 68W01 PDFBibTeX XMLCite \textit{L. A. Végh}, SIAM J. Comput. 45, No. 5, 1729--1761 (2016; Zbl 1410.91327) Full Text: DOI arXiv
Ben-Sasson, Eli; Ron-Zewi, Noga From affine to two-source extractors via approximate duality. (English) Zbl 1330.68219 SIAM J. Comput. 44, No. 6, 1670-1697 (2015). MSC: 68Q87 05C55 05D10 60C05 68W20 94A17 PDFBibTeX XMLCite \textit{E. Ben-Sasson} and \textit{N. Ron-Zewi}, SIAM J. Comput. 44, No. 6, 1670--1697 (2015; Zbl 1330.68219) Full Text: DOI
Dvir, Zeev; Kopparty, Swastik; Saraf, Shubhangi; Sudan, Madhu Extensions to the method of multiplicities, with applications to Kakeya sets and mergers. (English) Zbl 1285.68116 SIAM J. Comput. 42, No. 6, 2305-2328 (2013). MSC: 68Q87 68R05 51E99 PDFBibTeX XMLCite \textit{Z. Dvir} et al., SIAM J. Comput. 42, No. 6, 2305--2328 (2013; Zbl 1285.68116) Full Text: DOI Link
Svensson, Ola Santa Claus schedules jobs on unrelated machines. (English) Zbl 1257.68083 SIAM J. Comput. 41, No. 5, 1318-1341 (2012). MSC: 68Q25 68M20 68W25 PDFBibTeX XMLCite \textit{O. Svensson}, SIAM J. Comput. 41, No. 5, 1318--1341 (2012; Zbl 1257.68083) Full Text: DOI arXiv
Saxena, Nitin; Seshadhri, C. Blackbox identity testing for bounded top-fanin depth-3 circuits: the field doesn’t matter. (English) Zbl 1272.68162 SIAM J. Comput. 41, No. 5, 1285-1298 (2012). MSC: 68Q25 12Y05 68W30 PDFBibTeX XMLCite \textit{N. Saxena} and \textit{C. Seshadhri}, SIAM J. Comput. 41, No. 5, 1285--1298 (2012; Zbl 1272.68162) Full Text: DOI arXiv
Friedgut, Ehud; Kalai, Gil; Keller, Nathan; Nisan, Noam A quantitative version of the Gibbard-Satterthwaite theorem for three alternatives. (English) Zbl 1229.05264 SIAM J. Comput. 40, No. 3, 934-952 (2011). MSC: 05D40 91B14 68Q87 PDFBibTeX XMLCite \textit{E. Friedgut} et al., SIAM J. Comput. 40, No. 3, 934--952 (2011; Zbl 1229.05264) Full Text: DOI arXiv
Doty, David Randomized self-assembly for exact shapes. (English) Zbl 1247.68318 SIAM J. Comput. 39, No. 8, 3521-3552 (2010). Reviewer: Gregory Loren McColm (Tampa) MSC: 68W20 05D40 68Q05 68Q10 PDFBibTeX XMLCite \textit{D. Doty}, SIAM J. Comput. 39, No. 8, 3521--3552 (2010; Zbl 1247.68318) Full Text: DOI arXiv
Chekuri, Chandra; Khanna, Sanjeev A polynomial time approximation scheme for the multiple knapsack problem. (English) Zbl 1095.68035 SIAM J. Comput. 35, No. 3, 713-728 (2006). MSC: 90C27 90C59 68W25 68Q17 68Q25 PDFBibTeX XMLCite \textit{C. Chekuri} and \textit{S. Khanna}, SIAM J. Comput. 35, No. 3, 713--728 (2006; Zbl 1095.68035) Full Text: DOI
Leung, Joseph Y.-T.; Pinedo, Michael Minimizing total completion time on parallel machines with deadline constraints. (English) Zbl 1052.90034 SIAM J. Comput. 32, No. 5, 1370-1388 (2003). MSC: 90B35 68M20 90C60 PDFBibTeX XMLCite \textit{J. Y. T. Leung} and \textit{M. Pinedo}, SIAM J. Comput. 32, No. 5, 1370--1388 (2003; Zbl 1052.90034) Full Text: DOI
Püschel, Markus; Moura, José M. F. The algebraic approach to the discrete cosine and sine transforms and their fast algorithms. (English) Zbl 1046.42003 SIAM J. Comput. 32, No. 5, 1280-1316 (2003). MSC: 42A38 42C05 42C10 33C80 33C90 65T50 94A12 PDFBibTeX XMLCite \textit{M. Püschel} and \textit{J. M. F. Moura}, SIAM J. Comput. 32, No. 5, 1280--1316 (2003; Zbl 1046.42003) Full Text: DOI
Mourrain, B.; Pan, V. Y.; Ruatta, O. Accelerated solution of multivariate polynomial systems of equations. (English) Zbl 1030.65051 SIAM J. Comput. 32, No. 2, 435-454 (2003). Reviewer: Iulian Coroian (Baia Mare) MSC: 65H10 12Y05 30C15 68W20 26C10 65F15 PDFBibTeX XMLCite \textit{B. Mourrain} et al., SIAM J. Comput. 32, No. 2, 435--454 (2003; Zbl 1030.65051) Full Text: DOI
Chen, Jianer; Miranda, Antonio A polynomial time approximation scheme for general multiprocessor job scheduling. (English) Zbl 0992.68009 SIAM J. Comput. 31, No. 1, 1-17 (2001). MSC: 68M20 90B35 90C27 90C39 68Q25 68W05 PDFBibTeX XMLCite \textit{J. Chen} and \textit{A. Miranda}, SIAM J. Comput. 31, No. 1, 1--17 (2001; Zbl 0992.68009) Full Text: DOI
Jiang, Tao; Kearney, Paul; Li, Ming A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application. (English) Zbl 0980.68055 SIAM J. Comput. 30, No. 6, 1942-1961 (2001). MSC: 68Q25 92B99 PDFBibTeX XMLCite \textit{T. Jiang} et al., SIAM J. Comput. 30, No. 6, 1942--1961 (2001; Zbl 0980.68055) Full Text: DOI
Reif, John H. Approximate complex polynomial evaluation in near constant work per point. (English) Zbl 1015.65008 SIAM J. Comput. 28, No. 6, 2059-2089 (1999). MSC: 65D15 68Q25 65Y20 PDFBibTeX XMLCite \textit{J. H. Reif}, SIAM J. Comput. 28, No. 6, 2059--2089 (1999; Zbl 1015.65008) Full Text: DOI
Broder, Andrei Z.; Frieze, Alan M.; Suen, Stephen; Upfal, Eli Optimal construction of edge-disjoint paths in random graphs. (English) Zbl 0912.05058 SIAM J. Comput. 28, No. 2, 541-573 (1998). MSC: 05C85 05C38 05C80 05C40 60G50 68W10 68Q25 68R10 90B10 90B18 PDFBibTeX XMLCite \textit{A. Z. Broder} et al., SIAM J. Comput. 28, No. 2, 541--573 (1998; Zbl 0912.05058) Full Text: DOI
Barnes, Greg; Buss, Jonathan F.; Ruzzo, Walter L.; Schieber, Baruch A sublinear space, polynomial time algorithm for directed s-t connectivity. (English) Zbl 0908.05080 SIAM J. Comput. 27, No. 5, 1273-1282 (1998). Reviewer: Klaus Dohmen (Berlin) MSC: 05C85 05C40 68Q05 68Q15 68W10 68Q25 PDFBibTeX XMLCite \textit{G. Barnes} et al., SIAM J. Comput. 27, No. 5, 1273--1282 (1998; Zbl 0908.05080) Full Text: DOI
Agarwal, Pankaj K.; Suri, Subhash Surface approximation and geometric partitions. (English) Zbl 0911.65149 SIAM J. Comput. 27, No. 4, 1016-1035 (1998). Reviewer: H.Guggenheimer (West Hempstead) MSC: 65D18 68U05 65Y20 68Q25 PDFBibTeX XMLCite \textit{P. K. Agarwal} and \textit{S. Suri}, SIAM J. Comput. 27, No. 4, 1016--1035 (1998; Zbl 0911.65149) Full Text: DOI
Dyer, Martin; Gritzmann, Peter; Hufnagel, Alexander On the complexity of computing mixed volumes. (English) Zbl 0909.68193 SIAM J. Comput. 27, No. 2, 356-400 (1998). MSC: 68U05 52A39 52B55 68W10 68Q15 68R05 52A20 90C30 90C25 PDFBibTeX XMLCite \textit{M. Dyer} et al., SIAM J. Comput. 27, No. 2, 356--400 (1998; Zbl 0909.68193) Full Text: DOI
Driscoll, J. R.; Healy, D. M. jun.; Rockmore, D. N. Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs. (English) Zbl 0896.65094 SIAM J. Comput. 26, No. 4, 1066-1099 (1997). Reviewer: A.Bultheel (Leuven) MSC: 65T50 42C05 42-04 05C12 42C10 PDFBibTeX XMLCite \textit{J. R. Driscoll} et al., SIAM J. Comput. 26, No. 4, 1066--1099 (1997; Zbl 0896.65094) Full Text: DOI
Murota, Kazuo Computing the degree of determinants via combinatorial relaxation. (English) Zbl 0834.05037 SIAM J. Comput. 24, No. 4, 765-796 (1995). Reviewer: K.Burian (Havířov) MSC: 05C50 15A15 68W30 68Q25 PDFBibTeX XMLCite \textit{K. Murota}, SIAM J. Comput. 24, No. 4, 765--796 (1995; Zbl 0834.05037) Full Text: DOI
Kannan, Sampath K.; Warnow, Tandy J. Tree reconstruction from partial orders. (English) Zbl 0830.05021 SIAM J. Comput. 24, No. 3, 511-519 (1995). Reviewer: L.A.Székely (Budapest) MSC: 05C05 05C85 06A07 06A06 68Q25 92-08 92B05 92D15 92D20 PDFBibTeX XMLCite \textit{S. K. Kannan} and \textit{T. J. Warnow}, SIAM J. Comput. 24, No. 3, 511--519 (1995; Zbl 0830.05021) Full Text: DOI
Agarwala, Richa; Fernández-Baca, David A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed. (English) Zbl 0835.68052 SIAM J. Comput. 23, No. 6, 1216-1224 (1994). MSC: 68Q25 92-08 PDFBibTeX XMLCite \textit{R. Agarwala} and \textit{D. Fernández-Baca}, SIAM J. Comput. 23, No. 6, 1216--1224 (1994; Zbl 0835.68052) Full Text: DOI
Hochbaum, Dorit S.; Naor, Joseph Simple and fast algorithms for linear and integer programs with two variables per inequality. (English) Zbl 0831.90089 SIAM J. Comput. 23, No. 6, 1179-1192 (1994). Reviewer: D.Marinescu (Braşov) MSC: 90C10 05C85 90C05 68Q25 90C27 90C60 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{J. Naor}, SIAM J. Comput. 23, No. 6, 1179--1192 (1994; Zbl 0831.90089) Full Text: DOI
Pan, V. Y. New resultant inequalities and complex polynomial factorization. (English) Zbl 0822.12005 SIAM J. Comput. 23, No. 5, 934-950 (1994). MSC: 12Y05 12D05 65Y20 68Q25 65Y05 PDFBibTeX XMLCite \textit{V. Y. Pan}, SIAM J. Comput. 23, No. 5, 934--950 (1994; Zbl 0822.12005) Full Text: DOI
Deogun, Jitender S.; Steiner, George Polynomial algorithms for hamiltonian cycle in cocomparability graphs. (English) Zbl 0811.05043 SIAM J. Comput. 23, No. 3, 520-552 (1994). Reviewer: R.Faudree (Memphis) MSC: 05C45 05C85 68W10 06A06 68R10 PDFBibTeX XMLCite \textit{J. S. Deogun} and \textit{G. Steiner}, SIAM J. Comput. 23, No. 3, 520--552 (1994; Zbl 0811.05043) Full Text: DOI
Kim, Myong-Hi; Sutherland, Scott Polynomial root-finding algorithms and branched covers. (English) Zbl 0803.65066 SIAM J. Comput. 23, No. 2, 415-436 (1994). Reviewer: B.Döring (Düsseldorf) MSC: 65H05 65Y20 12Y05 58C10 30C15 37B99 PDFBibTeX XMLCite \textit{M.-H. Kim} and \textit{S. Sutherland}, SIAM J. Comput. 23, No. 2, 415--436 (1994; Zbl 0803.65066) Full Text: DOI arXiv
Bajaj, Chanderjit; Canny, John; Garrity, Thomas; Warren, Joe Factoring rational polynomials over the complex numbers. (English) Zbl 0772.12001 SIAM J. Comput. 22, No. 2, 318-331 (1993). Reviewer: F.Schwarz (Paderborn) MSC: 12D05 12Y05 68Q25 PDFBibTeX XMLCite \textit{C. Bajaj} et al., SIAM J. Comput. 22, No. 2, 318--331 (1993; Zbl 0772.12001) Full Text: DOI
Menezes, A. J.; van Oorschot, P. C.; Vanstone, S. A. Subgroup refinement algorithms for root finding in \(GF(q)\). (English) Zbl 0754.11041 SIAM J. Comput. 21, No. 2, 228-239 (1992). Reviewer: T.Pheidas (Iraklion) MSC: 11Y16 11T06 11Y05 68W30 PDFBibTeX XMLCite \textit{A. J. Menezes} et al., SIAM J. Comput. 21, No. 2, 228--239 (1992; Zbl 0754.11041) Full Text: DOI
Bein, Wolfgang W.; Kamburowski, Jerzy; Stallmann, Matthias F. M. Optimal reduction of two-terminal directed acyclic graphs. (English) Zbl 0768.68119 SIAM J. Comput. 21, No. 6, 1112-1129 (1992). Reviewer: M.Harminc (Košice) MSC: 68R10 05C20 68Q25 05C75 05C85 68M15 68W10 90B25 90C35 90C39 PDFBibTeX XMLCite \textit{W. W. Bein} et al., SIAM J. Comput. 21, No. 6, 1112--1129 (1992; Zbl 0768.68119) Full Text: DOI
Roth, Ron M.; Benedek, Gyora M. Interpolation and approximation of sparse multivariate polynomials over GF(2). (English) Zbl 0733.41003 SIAM J. Comput. 20, No. 2, 291-314 (1991). Reviewer: H.T.Lau (Verdun / Quebec) MSC: 41A05 41A10 68W10 68R99 94B35 PDFBibTeX XMLCite \textit{R. M. Roth} and \textit{G. M. Benedek}, SIAM J. Comput. 20, No. 2, 291--314 (1991; Zbl 0733.41003) Full Text: DOI Link
Grigoriev, Dima Yu.; Karpinski, Marek; Singer, Michael F. Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. (English) Zbl 0711.68059 SIAM J. Comput. 19, No. 6, 1059-1063 (1990). MSC: 68W30 11T06 12Y05 11Y16 PDFBibTeX XMLCite \textit{D. Yu. Grigoriev} et al., SIAM J. Comput. 19, No. 6, 1059--1063 (1990; Zbl 0711.68059) Full Text: DOI Link
Norton, G. H. Precise analyses of the right- and left-shift greatest common divisor algorithms for GF(q)[x]. (English) Zbl 0677.68052 SIAM J. Comput. 18, No. 3, 608-624 (1989). MSC: 68Q25 68W30 11A05 12E99 PDFBibTeX XMLCite \textit{G. H. Norton}, SIAM J. Comput. 18, No. 3, 608--624 (1989; Zbl 0677.68052) Full Text: DOI
Lagarias, Jeffrey C.; Reeds, James A. Unique extrapolation of polynomial recurrences. (English) Zbl 0662.65004 SIAM J. Comput. 17, No. 2, 342-362 (1988). Reviewer: W.Bartol MSC: 65C10 11T06 11B37 94A60 PDFBibTeX XMLCite \textit{J. C. Lagarias} and \textit{J. A. Reeds}, SIAM J. Comput. 17, No. 2, 342--362 (1988; Zbl 0662.65004) Full Text: DOI
Frieze, Alan M.; Håstad, Johan; Kannan, Ravi; Lagarias, Jeffrey C.; Shamir, Adi Reconstructing truncated integer variables satisfying linear congruences. (English) Zbl 0654.10006 SIAM J. Comput. 17, No. 2, 262-280 (1988). Reviewer: Michael Pohst (Berlin) MSC: 11Y16 11A07 68Q25 94A60 PDFBibTeX XMLCite \textit{A. M. Frieze} et al., SIAM J. Comput. 17, No. 2, 262--280 (1988; Zbl 0654.10006) Full Text: DOI
Bienstock, Daniel; Monma, Clyde L. On the complexity of covering vertices by faces in a planar graph. (English) Zbl 0646.68085 SIAM J. Comput. 17, No. 1, 53-76 (1988). MSC: 68R10 68Q25 05C10 PDFBibTeX XMLCite \textit{D. Bienstock} and \textit{C. L. Monma}, SIAM J. Comput. 17, No. 1, 53--76 (1988; Zbl 0646.68085) Full Text: DOI
Håstad, Johan Solving simultaneous modular equations of low degree. (English) Zbl 0642.94029 SIAM J. Comput. 17, No. 2, 336-341 (1988). Reviewer: H.J.Tiersma MSC: 94A60 11A07 68Q25 68W30 PDFBibTeX XMLCite \textit{J. Håstad}, SIAM J. Comput. 17, No. 2, 336--341 (1988; Zbl 0642.94029) Full Text: DOI Link
Lenstra, Arjen K. Factoring multivariate polynomials over algebraic number fields. (English) Zbl 0636.12005 SIAM J. Comput. 16, 591-598 (1987). Reviewer: Michael Pohst (Düsseldorf) MSC: 11Y16 11Y40 11R09 68W30 PDFBibTeX XMLCite \textit{A. K. Lenstra}, SIAM J. Comput. 16, 591--598 (1987; Zbl 0636.12005) Full Text: DOI Link
Horton, J. D. A polynomial-time algorithm to find the shortest cycle basis of a graph. (English) Zbl 0632.68064 SIAM J. Comput. 16, 358-366 (1987). MSC: 68R10 68Q25 05C38 05C35 PDFBibTeX XMLCite \textit{J. D. Horton}, SIAM J. Comput. 16, 358--366 (1987; Zbl 0632.68064) Full Text: DOI
Bach, Eric; Miller, Gary; Shallit, Jeffrey Sums of divisors, perfect numbers and factoring. (English) Zbl 0606.10003 SIAM J. Comput. 15, 1143-1154 (1986). Reviewer: Jeffrey Shallitt MSC: 11Y16 11Y05 11Y70 11A25 68W20 PDFBibTeX XMLCite \textit{E. Bach} et al., SIAM J. Comput. 15, 1143--1154 (1986; Zbl 0606.10003) Full Text: DOI Link
Maass, Wolfgang On the complexity of nonconvex covering. (English) Zbl 0603.68103 SIAM J. Comput. 15, 453-467 (1986). MSC: 68U99 68Q25 51M20 PDFBibTeX XMLCite \textit{W. Maass}, SIAM J. Comput. 15, 453--467 (1986; Zbl 0603.68103) Full Text: DOI
Hopcroft, J. E.; Wilfong, G. T. Reducing multiple object motion planning to graph searching. (English) Zbl 0596.05043 SIAM J. Comput. 15, 768-785 (1986). MSC: 05C40 68Q25 68R10 PDFBibTeX XMLCite \textit{J. E. Hopcroft} and \textit{G. T. Wilfong}, SIAM J. Comput. 15, 768--785 (1986; Zbl 0596.05043) Full Text: DOI Link
Kaltofen, Erich Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization. (English) Zbl 0605.12001 SIAM J. Comput. 14, 469-489 (1985). MSC: 11R09 68W30 11Y16 12-08 12D05 11T06 PDFBibTeX XMLCite \textit{E. Kaltofen}, SIAM J. Comput. 14, 469--489 (1985; Zbl 0605.12001) Full Text: DOI Link
Matsumoto, Kazuhiko; Nishizeki, Takao; Saito, Nobuji An efficient algorithm for finding multicommodity flows in planar networks. (English) Zbl 0572.90027 SIAM J. Comput. 14, 289-302 (1985). MSC: 90B10 68Q25 65K05 90C35 PDFBibTeX XMLCite \textit{K. Matsumoto} et al., SIAM J. Comput. 14, 289--302 (1985; Zbl 0572.90027) Full Text: DOI
Landau, Susan Factoring polynomials over algebraic number fields. (English) Zbl 0565.12002 SIAM J. Comput. 14, 184-195 (1985). Reviewer: F.J.van der Linden MSC: 11R09 12-04 68W99 12D05 PDFBibTeX XMLCite \textit{S. Landau}, SIAM J. Comput. 14, 184--195 (1985; Zbl 0565.12002) Full Text: DOI
von zur Gathen, Joachim Parallel algorithms for algebraic problems. (English) Zbl 0553.68032 SIAM J. Comput. 13, 802-824 (1984). MSC: 68W30 13F20 11T06 13M10 12E05 12D05 68Q25 PDFBibTeX XMLCite \textit{J. von zur Gathen}, SIAM J. Comput. 13, 802--824 (1984; Zbl 0553.68032) Full Text: DOI
Baker, B. S.; Coffman, E. G. jun. Insertion and compaction algorithms in sequentially allocated storage. (English) Zbl 0545.68063 SIAM J. Comput. 13, 600-609 (1984). MSC: 68R99 68Q25 PDFBibTeX XMLCite \textit{B. S. Baker} and \textit{E. G. Coffman jun.}, SIAM J. Comput. 13, 600--609 (1984; Zbl 0545.68063) Full Text: DOI
Dyer, M. E. Linear time algorithms for two- and three-variable linear programs. (English) Zbl 0532.90063 SIAM J. Comput. 13, 31-45 (1984). MSC: 90C05 68Q25 65K05 PDFBibTeX XMLCite \textit{M. E. Dyer}, SIAM J. Comput. 13, 31--45 (1984; Zbl 0532.90063) Full Text: DOI
Loos, Rüdiger Computing rational zeros of integral polynomials by p-adic expansion. (English) Zbl 0536.68045 SIAM J. Comput. 12, 286-293 (1983). Reviewer: J.Davenport MSC: 68W30 11R09 11S99 65H05 PDFBibTeX XMLCite \textit{R. Loos}, SIAM J. Comput. 12, 286--293 (1983; Zbl 0536.68045) Full Text: DOI
Megiddo, Nimrod Towards a genuinely polynomial algorithm for linear programming. (English) Zbl 0532.90061 SIAM J. Comput. 12, 347-353 (1983). MSC: 90C05 68Q25 PDFBibTeX XMLCite \textit{N. Megiddo}, SIAM J. Comput. 12, 347--353 (1983; Zbl 0532.90061) Full Text: DOI
Kaltofen, Erich; Musser, David R.; Saunders, B. David A generalized class of polynomials that are hard to factor. (English) Zbl 0529.68018 SIAM J. Comput. 12, 473-483 (1983). MSC: 68W30 11R09 68Q25 11R18 PDFBibTeX XMLCite \textit{E. Kaltofen} et al., SIAM J. Comput. 12, 473--483 (1983; Zbl 0529.68018) Full Text: DOI
Simons, Barbara Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. (English) Zbl 0512.68031 SIAM J. Comput. 12, 294-299 (1983). MSC: 68M20 PDFBibTeX XMLCite \textit{B. Simons}, SIAM J. Comput. 12, 294--299 (1983; Zbl 0512.68031) Full Text: DOI
Nakajima, K.; Hakimi, S. L.; Lenstra, J. K. Complexity results for scheduling tasks in fixed intervals on two types of machines. (English) Zbl 0486.68020 SIAM J. Comput. 11, 512-520 (1982). MSC: 68M20 68Q25 PDFBibTeX XMLCite \textit{K. Nakajima} et al., SIAM J. Comput. 11, 512--520 (1982; Zbl 0486.68020) Full Text: DOI Link
Yannakakis, M. Node-deletion problems on bipartite graphs. (English) Zbl 0468.05044 SIAM J. Comput. 10, 310-327 (1981). MSC: 05C35 05C50 PDFBibTeX XMLCite \textit{M. Yannakakis}, SIAM J. Comput. 10, 310--327 (1981; Zbl 0468.05044) Full Text: DOI
Megiddo, N.; Tamir, A.; Zemel, E.; Chandrasekaran, R. An O(n \(log^ 2\) n) algorithm for the kth longest path in a tree with applications to location problems. (English) Zbl 0456.68071 SIAM J. Comput. 10, 328-337 (1981). MSC: 68R10 PDFBibTeX XMLCite \textit{N. Megiddo} et al., SIAM J. Comput. 10, 328--337 (1981; Zbl 0456.68071) Full Text: DOI
Rabin, Michael O. Probabilistic algorithms in finite fields. (English) Zbl 0461.12012 SIAM J. Comput. 9, 273-280 (1980). MSC: 11T06 11K16 68Q25 11T55 12-04 PDFBibTeX XMLCite \textit{M. O. Rabin}, SIAM J. Comput. 9, 273--280 (1980; Zbl 0461.12012) Full Text: DOI
Aspvall, Bengt; Shiloach, Yossi A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality. (English) Zbl 0447.68036 SIAM J. Comput. 9, 827-845 (1980). MSC: 68Q25 90C05 PDFBibTeX XMLCite \textit{B. Aspvall} and \textit{Y. Shiloach}, SIAM J. Comput. 9, 827--845 (1980; Zbl 0447.68036) Full Text: DOI
Shiloach, Yossi Multi-terminal 0-1 flow. (English) Zbl 0419.90077 SIAM J. Comput. 8, 422-430 (1979). MSC: 90C35 90B10 68Q25 PDFBibTeX XMLCite \textit{Y. Shiloach}, SIAM J. Comput. 8, 422--430 (1979; Zbl 0419.90077) Full Text: DOI
Wang, Paul S.; Trager, Barry M. New algorithms for polynomial square-free decomposition over the integers. (English) Zbl 0415.10050 SIAM J. Comput. 8, 300-305 (1979). MSC: 11C08 11A07 12D05 68W99 PDFBibTeX XMLCite \textit{P. S. Wang} and \textit{B. M. Trager}, SIAM J. Comput. 8, 300--305 (1979; Zbl 0415.10050) Full Text: DOI