Ankirchner, Stefan; Blanchet-Scalliet, Christophette; Dorobantu, Diana; Gay, Laura First passage time density of an Ornstein-Uhlenbeck process with broken drift. (English) Zbl 07511764 Stoch. Models 38, No. 2, 308-329 (2022). MSC: 60-XX 91-XX 90-XX PDF BibTeX XML Cite \textit{S. Ankirchner} et al., Stoch. Models 38, No. 2, 308--329 (2022; Zbl 07511764) Full Text: DOI OpenURL
Gapeev, Pavel V.; Kort, Peter M.; Lavrutich, Maria N. Discounted optimal stopping problems for maxima of geometric Brownian motions with switching payoffs. (English) Zbl 07458584 Adv. Appl. Probab. 53, No. 1, 189-219 (2021). MSC: 60G40 60G44 60J65 91B25 60J27 35R35 PDF BibTeX XML Cite \textit{P. V. Gapeev} et al., Adv. Appl. Probab. 53, No. 1, 189--219 (2021; Zbl 07458584) Full Text: DOI OpenURL
Bercea, Ioana O.; Even, Guy Upper tail analysis of bucket sort and random tries. (English) Zbl 07429275 Theor. Comput. Sci. 895, 55-67 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{I. O. Bercea} and \textit{G. Even}, Theor. Comput. Sci. 895, 55--67 (2021; Zbl 07429275) Full Text: DOI arXiv OpenURL
Ratanov, Nikita On telegraph processes, their first passage times and running extrema. (English) Zbl 1482.60128 Stat. Probab. Lett. 174, Article ID 109101, 8 p. (2021). MSC: 60K99 60J27 PDF BibTeX XML Cite \textit{N. Ratanov}, Stat. Probab. Lett. 174, Article ID 109101, 8 p. (2021; Zbl 1482.60128) Full Text: DOI arXiv OpenURL
Lehre, Per Kristian; Nguyen, Phan Trung Hai Runtime analyses of the population-based univariate estimation of distribution algorithms on LeadingOnes. (English) Zbl 07421506 Algorithmica 83, No. 10, 3238-3280 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{P. K. Lehre} and \textit{P. T. H. Nguyen}, Algorithmica 83, No. 10, 3238--3280 (2021; Zbl 07421506) Full Text: DOI OpenURL
Bossek, Jakob; Neumann, Frank; Peng, Pan; Sudholt, Dirk Time complexity analysis of randomized search heuristics for the dynamic graph coloring problem. (English) Zbl 07421503 Algorithmica 83, No. 10, 3148-3179 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{J. Bossek} et al., Algorithmica 83, No. 10, 3148--3179 (2021; Zbl 07421503) Full Text: DOI arXiv OpenURL
Sun, Guodong; Zhang, Chao; Zhu, Hua; Lang, Shihui Influences of embedding parameters and segment sizes in recursive characteristics analysis on coefficients of friction. (English) Zbl 1464.37081 Int. J. Bifurcation Chaos Appl. Sci. Eng. 31, No. 4, Article ID 2150058, 16 p. (2021). MSC: 37M10 37M22 37D45 PDF BibTeX XML Cite \textit{G. Sun} et al., Int. J. Bifurcation Chaos Appl. Sci. Eng. 31, No. 4, Article ID 2150058, 16 p. (2021; Zbl 1464.37081) Full Text: DOI OpenURL
Qian, Chao; Bian, Chao; Yu, Yang; Tang, Ke; Yao, Xin Analysis of noisy evolutionary optimization when sampling fails. (English) Zbl 07331691 Algorithmica 83, No. 4, 940-975 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{C. Qian} et al., Algorithmica 83, No. 4, 940--975 (2021; Zbl 07331691) Full Text: DOI arXiv OpenURL
Gushchin, A. A. The joint law of a max-continuous local submartingale and its maximum. (English. Russian original) Zbl 1469.60128 Theory Probab. Appl. 65, No. 4, 545-557 (2021); translation from Teor. Veroyatn. Primen. 65, No. 4, 693-709 (2020). MSC: 60G44 60G70 PDF BibTeX XML Cite \textit{A. A. Gushchin}, Theory Probab. Appl. 65, No. 4, 545--557 (2021; Zbl 1469.60128); translation from Teor. Veroyatn. Primen. 65, No. 4, 693--709 (2020) Full Text: DOI OpenURL
Gapeev, Pavel V. Optimal stopping problems for running minima with positive discounting rates. (English) Zbl 1464.60036 Stat. Probab. Lett. 167, Article ID 108899, 12 p. (2020). Reviewer: Krzysztof J. Szajowski (Wrocław) MSC: 60G40 60G44 60J65 91G20 PDF BibTeX XML Cite \textit{P. V. Gapeev}, Stat. Probab. Lett. 167, Article ID 108899, 12 p. (2020; Zbl 1464.60036) Full Text: DOI OpenURL
Calude, Cristian S.; Dumitrescu, Monica A statistical anytime algorithm for the halting problem. (English) Zbl 07271561 Computability 9, No. 2, 155-166 (2020). MSC: 68Q87 60E15 68Q25 PDF BibTeX XML Cite \textit{C. S. Calude} and \textit{M. Dumitrescu}, Computability 9, No. 2, 155--166 (2020; Zbl 07271561) Full Text: DOI OpenURL
Bian, Chao; Qian, Chao; Tang, Ke; Yu, Yang Running time analysis of the (1+1)-EA for robust linear optimization. (English) Zbl 1460.68137 Theor. Comput. Sci. 843, 57-72 (2020). MSC: 68W50 68W40 90C10 90C17 90C59 PDF BibTeX XML Cite \textit{C. Bian} et al., Theor. Comput. Sci. 843, 57--72 (2020; Zbl 1460.68137) Full Text: DOI arXiv OpenURL
Albuquerque Raymundo Da Silva, Ian; Calinescu, Gruia; De Graaf, Nathan Faster compression of patterns to rectangle rule lists. (English) Zbl 1443.68061 Theor. Comput. Sci. 828-829, 1-18 (2020). MSC: 68P30 68W40 PDF BibTeX XML Cite \textit{I. Albuquerque Raymundo Da Silva} et al., Theor. Comput. Sci. 828--829, 1--18 (2020; Zbl 1443.68061) Full Text: DOI OpenURL
Gajser, David Verifying whether one-tape Turing machines run in linear time. (English) Zbl 1436.68106 J. Comput. Syst. Sci. 107, 93-107 (2020). MSC: 68Q04 68Q17 68Q25 PDF BibTeX XML Cite \textit{D. Gajser}, J. Comput. Syst. Sci. 107, 93--107 (2020; Zbl 1436.68106) Full Text: DOI arXiv OpenURL
Kel’manov, Alexander; Khamidullin, Sergey; Khandeev, Vladimir; Pyatkin, Artem An exact algorithm of searching for the largest size cluster in an integer sequence 2-clustering problem. (English) Zbl 1468.90109 Evtushenko, Yury (ed.) et al., Optimization and applications. 9th international conference, OPTIMA 2018, Petrovac, Montenegro, October 1–5, 2018. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 974, 131-143 (2019). MSC: 90C27 PDF BibTeX XML Cite \textit{A. Kel'manov} et al., Commun. Comput. Inf. Sci. 974, 131--143 (2019; Zbl 1468.90109) Full Text: DOI OpenURL
Lehre, Per Kristian; Nguyen, Phan Trung Hai On the limitations of the univariate marginal distribution algorithm to deception and where bivariate EDAs might help. (English) Zbl 1433.68646 Proceedings of the 15th ACM/SIGEVO workshop on foundations of genetic algorithms, FOGA 2019, Potsdam, Germany, August 27–29, 2019. New York, NY: Association for Computing Machinery (ACM). 154-168 (2019). MSC: 68W50 68T20 68W40 PDF BibTeX XML Cite \textit{P. K. Lehre} and \textit{P. T. H. Nguyen}, in: Proceedings of the 15th ACM/SIGEVO workshop on foundations of genetic algorithms, FOGA 2019, Potsdam, Germany, August 27--29, 2019. New York, NY: Association for Computing Machinery (ACM). 154--168 (2019; Zbl 1433.68646) Full Text: DOI arXiv OpenURL
Qian, Chao; Yu, Yang; Tang, Ke; Yao, Xin; Zhou, Zhi-Hua Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms. (English) Zbl 1482.90187 Artif. Intell. 275, 279-294 (2019). MSC: 90C27 68W50 90C59 PDF BibTeX XML Cite \textit{C. Qian} et al., Artif. Intell. 275, 279--294 (2019; Zbl 1482.90187) Full Text: DOI arXiv OpenURL
Lyu, Hanbaek; Sivakoff, David Persistence of sums of correlated increments and clustering in cellular automata. (English) Zbl 1478.60198 Stochastic Processes Appl. 129, No. 4, 1132-1152 (2019). MSC: 60J05 37B15 60K35 PDF BibTeX XML Cite \textit{H. Lyu} and \textit{D. Sivakoff}, Stochastic Processes Appl. 129, No. 4, 1132--1152 (2019; Zbl 1478.60198) Full Text: DOI arXiv OpenURL
Lee, Mei-Ling Ting A survey of threshold regression for time-to-event analysis and applications. (English) Zbl 1417.62318 Taiwanese J. Math. 23, No. 2, 293-305 (2019). MSC: 62P10 62N05 60J65 62J07 60G10 62M10 PDF BibTeX XML Cite \textit{M.-L. T. Lee}, Taiwanese J. Math. 23, No. 2, 293--305 (2019; Zbl 1417.62318) Full Text: DOI Euclid OpenURL
Qian, Chao; Bian, Chao; Jiang, Wu; Tang, Ke Running time analysis of the \((1+1)\)-EA for OneMax and LeadingOnes under bit-wise noise. (English) Zbl 1411.68147 Algorithmica 81, No. 2, 749-795 (2019). MSC: 68T20 68W40 90C59 PDF BibTeX XML Cite \textit{C. Qian} et al., Algorithmica 81, No. 2, 749--795 (2019; Zbl 1411.68147) Full Text: DOI arXiv OpenURL
Witt, Carsten Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax. (English) Zbl 1414.68107 Algorithmica 81, No. 2, 632-667 (2019). MSC: 68T20 68W20 68W40 90C59 PDF BibTeX XML Cite \textit{C. Witt}, Algorithmica 81, No. 2, 632--667 (2019; Zbl 1414.68107) Full Text: DOI arXiv OpenURL
Haugland, Dag Fast methods for the index tracking problem. (English) Zbl 1397.90411 Kliewer, Natalia (ed.) et al., Operations research proceedings 2017. Selected papers of the annual international conference of the German Operations Research Society (GOR), Freie Universiät Berlin, Germany, September 6–8, 2017. Cham: Springer (ISBN 978-3-319-89919-0/pbk; 978-3-319-89920-6/ebook). Operations Research Proceedings, 277-283 (2018). MSC: 90C59 90C90 91G10 91G80 PDF BibTeX XML Cite \textit{D. Haugland}, Oper. Res. Proc. 2017, 277--283 (2018; Zbl 1397.90411) Full Text: DOI OpenURL
Coutin, Laure; Pontier, Monique; Ngom, Waly Joint distribution of a Lévy process and its running supremum. (English) Zbl 1396.60049 J. Appl. Probab. 55, No. 2, 488-512 (2018). MSC: 60G51 60H20 PDF BibTeX XML Cite \textit{L. Coutin} et al., J. Appl. Probab. 55, No. 2, 488--512 (2018; Zbl 1396.60049) Full Text: DOI HAL OpenURL
Calude, Cristian S.; Dumitrescu, Monica A probabilistic anytime algorithm for the halting problem. (English) Zbl 1394.68260 Computability 7, No. 2-3, 259-271 (2018). MSC: 68Q87 03D35 60E05 68Q25 PDF BibTeX XML Cite \textit{C. S. Calude} and \textit{M. Dumitrescu}, Computability 7, No. 2--3, 259--271 (2018; Zbl 1394.68260) Full Text: DOI OpenURL
Saporito, Yuri F. The functional Meyer-Tanaka formula. (English) Zbl 1394.60076 Stoch. Dyn. 18, No. 4, Article ID 1850030, 25 p. (2018). MSC: 60H99 60G17 60H07 PDF BibTeX XML Cite \textit{Y. F. Saporito}, Stoch. Dyn. 18, No. 4, Article ID 1850030, 25 p. (2018; Zbl 1394.60076) Full Text: DOI arXiv OpenURL
Hamburger, Christoph The optimal runner on the royal road. (English) Zbl 1406.49027 Math. Methods Appl. Sci. 41, No. 10, 3525-3532 (2018). Reviewer: Hector O. Fattorini (Los Angeles) MSC: 49L99 49J15 49K15 49J30 PDF BibTeX XML Cite \textit{C. Hamburger}, Math. Methods Appl. Sci. 41, No. 10, 3525--3532 (2018; Zbl 1406.49027) Full Text: DOI OpenURL
Henk, Martin A note on lattice packings via lattice refinements. (English) Zbl 1388.52011 Exp. Math. 27, No. 1, 1-9 (2018). MSC: 52C07 52C17 11H06 PDF BibTeX XML Cite \textit{M. Henk}, Exp. Math. 27, No. 1, 1--9 (2018; Zbl 1388.52011) Full Text: DOI OpenURL
Angel, Omer; Bubeck, Sébastien; Peres, Yuval; Wei, Fan Local max-cut in smoothed polynomial time. (English) Zbl 1369.68226 Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 429-437 (2017). MSC: 68Q25 68T20 91A10 PDF BibTeX XML Cite \textit{O. Angel} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 429--437 (2017; Zbl 1369.68226) Full Text: DOI arXiv OpenURL
Corus, Dogan; He, Jun; Jansen, Thomas; Oliveto, Pietro S.; Sudholt, Dirk; Zarges, Christine On easiest functions for mutation operators in bio-inspired optimisation. (English) Zbl 1366.68257 Algorithmica 78, No. 2, 714-740 (2017). MSC: 68T20 68W40 90C59 PDF BibTeX XML Cite \textit{D. Corus} et al., Algorithmica 78, No. 2, 714--740 (2017; Zbl 1366.68257) Full Text: DOI OpenURL
Christensen, Sören Author’s response. (English) Zbl 1419.60036 Sequential Anal. 36, No. 1, 33-37 (2017). MSC: 60G40 62L20 60J25 PDF BibTeX XML Cite \textit{S. Christensen}, Sequential Anal. 36, No. 1, 33--37 (2017; Zbl 1419.60036) Full Text: DOI OpenURL
Christensen, Sören An effective method for the explicit solution of sequential problems on the real line. (English) Zbl 1427.60066 Sequential Anal. 36, No. 1, 2-18 (2017). MSC: 60G40 62L10 60J25 PDF BibTeX XML Cite \textit{S. Christensen}, Sequential Anal. 36, No. 1, 2--18 (2017; Zbl 1427.60066) Full Text: DOI OpenURL
Abundo, Mario The mean of the running maximum of an integrated Gauss-Markov process and the connection with its first-passage time. (English) Zbl 1364.60094 Stochastic Anal. Appl. 35, No. 3, 499-510 (2017). MSC: 60J25 60G15 60G70 60J65 60H05 60J60 60H10 PDF BibTeX XML Cite \textit{M. Abundo}, Stochastic Anal. Appl. 35, No. 3, 499--510 (2017; Zbl 1364.60094) Full Text: DOI OpenURL
Jansen, Klaus; Rau, Malin Improved approximation for two dimensional strip packing with polynomial bounded width. (English) Zbl 1427.68368 Poon, Sheung-Hung (ed.) et al., WALCOM: algorithms and computation. 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10167, 409-420 (2017). MSC: 68W25 90C27 PDF BibTeX XML Cite \textit{K. Jansen} and \textit{M. Rau}, Lect. Notes Comput. Sci. 10167, 409--420 (2017; Zbl 1427.68368) Full Text: DOI arXiv OpenURL
Ageev, Alexander Constant-factor approximations for cycle cover problems. (English) Zbl 1385.90001 Kochetov, Yury (ed.) et al., Discrete optimization and operations research. 9th international conference, DOOR 2016, Vladivostok, Russia, September 19–23, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-44913-5/pbk; 978-3-319-44914-2/ebook). Lecture Notes in Computer Science 9869, 93-104 (2016). MSC: 90B06 PDF BibTeX XML Cite \textit{A. Ageev}, Lect. Notes Comput. Sci. 9869, 93--104 (2016; Zbl 1385.90001) Full Text: DOI OpenURL
Feng, Runhuan Stochastic integral representations of the extrema of time-homogeneous diffusion processes. (English) Zbl 1352.60113 Methodol. Comput. Appl. Probab. 18, No. 3, 691-715 (2016). MSC: 60J60 60H05 60G70 60G44 60G17 PDF BibTeX XML Cite \textit{R. Feng}, Methodol. Comput. Appl. Probab. 18, No. 3, 691--715 (2016; Zbl 1352.60113) Full Text: DOI OpenURL
Mohammadi, Zahra; Valero, Oscar A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms. (English) Zbl 1334.54068 Topology Appl. 203, 42-56 (2016). MSC: 54H25 54E50 54F05 68Q25 PDF BibTeX XML Cite \textit{Z. Mohammadi} and \textit{O. Valero}, Topology Appl. 203, 42--56 (2016; Zbl 1334.54068) Full Text: DOI OpenURL
Teimoortashloo, Mazdak; Sedigh, Ali Khaki A modified independent component analysis-based fault detection method in plant-wide systems. (English) Zbl 1336.93154 Control Cybern. 44, No. 2, 287-310 (2015). MSC: 93E10 93C95 93A15 PDF BibTeX XML Cite \textit{M. Teimoortashloo} and \textit{A. K. Sedigh}, Control Cybern. 44, No. 2, 287--310 (2015; Zbl 1336.93154) OpenURL
Gajser, David Verifying time complexity of Turing machines. (English) Zbl 1329.68111 Theor. Comput. Sci. 600, 86-97 (2015). MSC: 68Q05 68Q25 PDF BibTeX XML Cite \textit{D. Gajser}, Theor. Comput. Sci. 600, 86--97 (2015; Zbl 1329.68111) Full Text: DOI arXiv OpenURL
Witt, Carsten Fitness levels with tail bounds for the analysis of randomized search heuristics. (English) Zbl 1329.68281 Inf. Process. Lett. 114, No. 1-2, 38-41 (2014). MSC: 68W20 68T20 PDF BibTeX XML Cite \textit{C. Witt}, Inf. Process. Lett. 114, No. 1--2, 38--41 (2014; Zbl 1329.68281) Full Text: DOI OpenURL
Alghamdi, Maryam A.; Shahzad, Naseer; Valero, Oscar New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs. (English) Zbl 1392.68450 Fixed Point Theory Appl. 2014, Paper No. 14, 18 p. (2014). MSC: 68W40 54E52 54H25 68Q25 PDF BibTeX XML Cite \textit{M. A. Alghamdi} et al., Fixed Point Theory Appl. 2014, Paper No. 14, 18 p. (2014; Zbl 1392.68450) Full Text: DOI OpenURL
Kamenov, A. A. On the solution of the optimal prediction problem for the maximum of a time-homogeneous diffusion. (English. Russian original) Zbl 1307.60043 Russ. Math. Surv. 69, No. 3, 569-571 (2014); translation from Usp. Mat. Nauk 69, No. 3, 177-178 (2014). Reviewer: Heinrich Hering (Rockenberg) MSC: 60G40 60H10 60J60 45J05 62L15 91A60 34F05 PDF BibTeX XML Cite \textit{A. A. Kamenov}, Russ. Math. Surv. 69, No. 3, 569--571 (2014; Zbl 1307.60043); translation from Usp. Mat. Nauk 69, No. 3, 177--178 (2014) Full Text: DOI OpenURL
Doerr, Benjamin; Winzen, Carola Reducing the arity in unbiased black-box complexity. (English) Zbl 1360.68777 Theor. Comput. Sci. 545, 108-121 (2014). MSC: 68T20 68Q25 68W20 PDF BibTeX XML Cite \textit{B. Doerr} and \textit{C. Winzen}, Theor. Comput. Sci. 545, 108--121 (2014; Zbl 1360.68777) Full Text: DOI arXiv OpenURL
Abchouyeh, Maryam Aghaei; Mirza, Behrouz; Sherkatghanad, Zeinab Entropic force, running gravitational coupling and future singularities. (English) Zbl 1286.83094 Gen. Relativ. Gravitation 46, No. 1, Article ID 1617, 11 p. (2014). MSC: 83F05 83C75 94A17 83C45 81T15 PDF BibTeX XML Cite \textit{M. A. Abchouyeh} et al., Gen. Relativ. Gravitation 46, No. 1, Article ID 1617, 11 p. (2014; Zbl 1286.83094) Full Text: DOI arXiv OpenURL
Ragab, Mahmoud; Roesler, Uwe The quicksort process. (English) Zbl 1306.60011 Stochastic Processes Appl. 124, No. 2, 1036-1054 (2014). Reviewer: Ivan Křivý (Ostrava) MSC: 60F05 68P10 60K99 PDF BibTeX XML Cite \textit{M. Ragab} and \textit{U. Roesler}, Stochastic Processes Appl. 124, No. 2, 1036--1054 (2014; Zbl 1306.60011) Full Text: DOI arXiv OpenURL
Qian, Chao; Yu, Yang; Zhou, Zhi-Hua An analysis on recombination in multi-objective evolutionary optimization. (English) Zbl 1334.68203 Artif. Intell. 204, 99-119 (2013). MSC: 68T20 68Q25 90C29 90C59 PDF BibTeX XML Cite \textit{C. Qian} et al., Artif. Intell. 204, 99--119 (2013; Zbl 1334.68203) Full Text: DOI OpenURL
Alghamdi, Maryam A.; Shahzad, Naseer; Valero, Oscar Fixed point theorems in generalized metric spaces with applications to computer science. (English) Zbl 1429.54044 Fixed Point Theory Appl. 2013, Paper No. 118, 20 p. (2013). MSC: 54H25 54E50 54F05 68Q25 PDF BibTeX XML Cite \textit{M. A. Alghamdi} et al., Fixed Point Theory Appl. 2013, Paper No. 118, 20 p. (2013; Zbl 1429.54044) Full Text: DOI OpenURL
Dorn, Frederic; Fomin, Fedor V.; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket Beyond bidimensionality: parameterized subexponential algorithms on directed graphs. (English) Zbl 1433.68290 Inf. Comput. 233, 60-70 (2013). MSC: 68R10 05C20 05C85 68Q27 68W40 PDF BibTeX XML Cite \textit{F. Dorn} et al., Inf. Comput. 233, 60--70 (2013; Zbl 1433.68290) Full Text: DOI OpenURL
Goldwasser, Shafi; Kalai, Yael Tauman; Popa, Raluca Ada; Vaikuntanathan, Vinod; Zeldovich, Nickolai How to run Turing machines on encrypted data. (English) Zbl 1311.94082 Canetti, Ran (ed.) et al., Advances in cryptology – CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18–22, 2013. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-40083-4/pbk). Lecture Notes in Computer Science 8043, 536-553 (2013). MSC: 94A60 PDF BibTeX XML Cite \textit{S. Goldwasser} et al., Lect. Notes Comput. Sci. 8043, 536--553 (2013; Zbl 1311.94082) Full Text: DOI OpenURL
Ahn, Hee-Kap; Cheng, Siu-Wing; Reinbacher, Iris Maximum overlap of convex polytopes under translation. (English) Zbl 1264.52009 Comput. Geom. 46, No. 5, 552-565 (2013). MSC: 52B10 52B11 52C45 68U05 PDF BibTeX XML Cite \textit{H.-K. Ahn} et al., Comput. Geom. 46, No. 5, 552--565 (2013; Zbl 1264.52009) Full Text: DOI OpenURL
An, P. T.; Hai, N. N.; Hoai, T. V. Direct multiple shooting method for solving approximate shortest path problems. (English) Zbl 1267.65073 J. Comput. Appl. Math. 244, 67-76 (2013). Reviewer: Hans Benker (Merseburg) MSC: 65K10 49J15 49M25 PDF BibTeX XML Cite \textit{P. T. An} et al., J. Comput. Appl. Math. 244, 67--76 (2013; Zbl 1267.65073) Full Text: DOI OpenURL
Doerr, Benjamin; Johannsen, Daniel; Kötzing, Timo; Neumann, Frank; Theile, Madeleine More effective crossover operators for the all-pairs shortest path problem. (English) Zbl 1259.68180 Theor. Comput. Sci. 471, 12-26 (2013). MSC: 68T20 68W05 90C27 PDF BibTeX XML Cite \textit{B. Doerr} et al., Theor. Comput. Sci. 471, 12--26 (2013; Zbl 1259.68180) Full Text: DOI OpenURL
Velikanova, Yu. Yu. Running time of local search algorithms for a scheduling problem on the parallel machines. (Russian) Zbl 1324.90065 Diskretn. Anal. Issled. Oper. 19, No. 5, 21-34 (2012). MSC: 90B35 PDF BibTeX XML Cite \textit{Yu. Yu. Velikanova}, Diskretn. Anal. Issled. Oper. 19, No. 5, 21--34 (2012; Zbl 1324.90065) Full Text: MNR OpenURL
Knof, Diether; Roesler, Uwe The analysis of Find and versions of it. (English) Zbl 1283.68143 Discrete Math. Theor. Comput. Sci. 14, No. 2, 129-154 (2012). MSC: 68P10 60E15 60J80 60F17 PDF BibTeX XML Cite \textit{D. Knof} and \textit{U. Roesler}, Discrete Math. Theor. Comput. Sci. 14, No. 2, 129--154 (2012; Zbl 1283.68143) Full Text: Link OpenURL
Sudholt, Dirk; Thyssen, Christian A simple ant colony optimizer for stochastic shortest path problems. (English) Zbl 1267.68219 Algorithmica 64, No. 4, 643-672 (2012). MSC: 68T20 68W05 90C27 PDF BibTeX XML Cite \textit{D. Sudholt} and \textit{C. Thyssen}, Algorithmica 64, No. 4, 643--672 (2012; Zbl 1267.68219) Full Text: DOI Link OpenURL
Grigorieva, Elena; Herings, P. Jean-Jacques; Müller, Rudolf; Vermeulen, Dries Fraction auctions: the tradeoff between efficiency and running time. (English) Zbl 1253.91080 Eur. J. Oper. Res. 220, No. 2, 577-587 (2012). MSC: 91B26 PDF BibTeX XML Cite \textit{E. Grigorieva} et al., Eur. J. Oper. Res. 220, No. 2, 577--587 (2012; Zbl 1253.91080) Full Text: DOI Link OpenURL
Cerdà-Uguet, M. A.; Schellekens, M. P.; Valero, O. The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science. (English) Zbl 1255.68314 Theory Comput. Syst. 50, No. 2, 387-399 (2012). MSC: 68W40 54H25 54H99 PDF BibTeX XML Cite \textit{M. A. Cerdà-Uguet} et al., Theory Comput. Syst. 50, No. 2, 387--399 (2012; Zbl 1255.68314) Full Text: DOI arXiv OpenURL
Witt, Carsten Optimizing linear functions with randomized search heuristics – the robustness of mutation. (English) Zbl 1245.68178 Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 420-431, electronic only (2012). MSC: 68T20 68W20 PDF BibTeX XML Cite \textit{C. Witt}, LIPIcs -- Leibniz Int. Proc. Inform. 14, 420--431 (2012; Zbl 1245.68178) Full Text: DOI OpenURL
Zhou, Dong; Luo, Dan; Lu, Ruqian; Han, Zhangang The use of tail inequalities on the probable computational time of randomized search heuristics. (English) Zbl 1242.68299 Theor. Comput. Sci. 436, 106-117 (2012). MSC: 68T20 68W27 68W40 PDF BibTeX XML Cite \textit{D. Zhou} et al., Theor. Comput. Sci. 436, 106--117 (2012; Zbl 1242.68299) Full Text: DOI OpenURL
Sudholt, Dirk; Thyssen, Christian Running time analysis of ant colony optimization for shortest path problems. (English) Zbl 1250.68238 J. Discrete Algorithms 10, 165-180 (2012). Reviewer: Thomas Jansen (Cork) MSC: 68T20 68W40 90C27 PDF BibTeX XML Cite \textit{D. Sudholt} and \textit{C. Thyssen}, J. Discrete Algorithms 10, 165--180 (2012; Zbl 1250.68238) Full Text: DOI OpenURL
Diem, Claus On the notion of bit complexity. (English) Zbl 1258.68057 Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 103, 36-52 (2011). MSC: 68Q05 68Q25 68W40 PDF BibTeX XML Cite \textit{C. Diem}, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 103, 36--52 (2011; Zbl 1258.68057) OpenURL
Bodlaender, Hans L.; Kratsch, Dieter Exact algorithms for Kayles. (English) Zbl 1339.05251 Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 59-70 (2011). MSC: 05C57 05C85 68Q17 91A43 91A05 PDF BibTeX XML Cite \textit{H. L. Bodlaender} and \textit{D. Kratsch}, Lect. Notes Comput. Sci. 6986, 59--70 (2011; Zbl 1339.05251) Full Text: DOI Link OpenURL
Bellare, Mihir; Goldreich, Oded On probabilistic versus deterministic provers in the definition of proofs of knowledge. (English) Zbl 1343.94042 Goldreich, Oded (ed.), Studies in complexity and cryptography. Miscellanea on the interplay between randomness and computation. In collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman. Berlin: Springer (ISBN 978-3-642-22669-4/pbk). Lecture Notes in Computer Science 6650, 114-123 (2011). MSC: 94A60 PDF BibTeX XML Cite \textit{M. Bellare} and \textit{O. Goldreich}, Lect. Notes Comput. Sci. 6650, 114--123 (2011; Zbl 1343.94042) Full Text: DOI Link OpenURL
Löpker, Andreas; Stadje, Wolfgang Hitting times and the running maximum of Markovian growth-collapse processes. (English) Zbl 1229.60104 J. Appl. Probab. 48, No. 2, 295-312 (2011). Reviewer: Alexander Schnurr (Dortmund) MSC: 60K30 60J25 60J75 60F05 PDF BibTeX XML Cite \textit{A. Löpker} and \textit{W. Stadje}, J. Appl. Probab. 48, No. 2, 295--312 (2011; Zbl 1229.60104) Full Text: DOI OpenURL
Friedrich, Tobias; Horoba, Christian; Neumann, Frank Illustration of fairness in evolutionary multi-objective optimization. (English) Zbl 1211.90209 Theor. Comput. Sci. 412, No. 17, 1546-1556 (2011). MSC: 90C29 68T20 PDF BibTeX XML Cite \textit{T. Friedrich} et al., Theor. Comput. Sci. 412, No. 17, 1546--1556 (2011; Zbl 1211.90209) Full Text: DOI OpenURL
Martínez, Conrado; Rösler, Uwe Partial Quicksort and Quickpartitionsort. (English) Zbl 1355.68071 Drmota, Michael (ed.) et al., Proceeding of the 21st international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA’10), Vienna, Austria, June 28 – July 2, 2010. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 505-512 (2010). MSC: 68P10 68Q87 68W40 PDF BibTeX XML Cite \textit{C. Martínez} and \textit{U. Rösler}, in: Proceeding of the 21st international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA'10), Vienna, Austria, June 28 -- July 2, 2010. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS). 505--512 (2010; Zbl 1355.68071) Full Text: Link OpenURL
Steiger, William; Zhao, Jihui Generalized ham-sandwich cuts. (English) Zbl 1206.52008 Discrete Comput. Geom. 44, No. 3, 535-545 (2010). Reviewer: Vladimir Golubyatnikov (Novosibirsk) MSC: 52A20 PDF BibTeX XML Cite \textit{W. Steiger} and \textit{J. Zhao}, Discrete Comput. Geom. 44, No. 3, 535--545 (2010; Zbl 1206.52008) Full Text: DOI OpenURL
Sakov, Anat; Golani, Ilan; Lipkind, Dina; Benjamini, Yoav High-throughput data analysis in behavior genetics. (English) Zbl 1194.62120 Ann. Appl. Stat. 4, No. 2, 743-763 (2010). MSC: 62P10 92D10 62M10 PDF BibTeX XML Cite \textit{A. Sakov} et al., Ann. Appl. Stat. 4, No. 2, 743--763 (2010; Zbl 1194.62120) Full Text: DOI arXiv OpenURL
Friedrich, Tobias; Neumann, Frank When to use bit-wise neutrality. (English) Zbl 1215.68213 Nat. Comput. 9, No. 1, 283-294 (2010). MSC: 68T20 68T05 90C59 PDF BibTeX XML Cite \textit{T. Friedrich} and \textit{F. Neumann}, Nat. Comput. 9, No. 1, 283--294 (2010; Zbl 1215.68213) Full Text: DOI OpenURL
Gapeev, Pavel V.; Jeanblanc, Monique Pricing of contingent claims in a two-dimensional model with random dividends. (English) Zbl 1182.91174 Int. J. Theor. Appl. Finance 12, No. 8, 1091-1104 (2009). MSC: 91G20 91B25 91G80 PDF BibTeX XML Cite \textit{P. V. Gapeev} and \textit{M. Jeanblanc}, Int. J. Theor. Appl. Finance 12, No. 8, 1091--1104 (2009; Zbl 1182.91174) Full Text: DOI OpenURL
Sergeev, S. I. The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching. (English. Russian original) Zbl 1231.90326 Autom. Remote Control 70, No. 11, 1901-1912 (2009); translation from Avtom. Telemekh. 2009, No. 11, 148-160 (2009). MSC: 90C27 05C35 PDF BibTeX XML Cite \textit{S. I. Sergeev}, Autom. Remote Control 70, No. 11, 1901--1912 (2009; Zbl 1231.90326); translation from Avtom. Telemekh. 2009, No. 11, 148--160 (2009) Full Text: DOI OpenURL
Tirado, Pedro; Valero, Oscar The average running time of an algorithm as a midpoint between fuzzy sets. (English) Zbl 1171.03333 Math. Comput. Modelling 49, No. 9-10, 1852-1868 (2009). MSC: 03E72 68W01 68W40 PDF BibTeX XML Cite \textit{P. Tirado} and \textit{O. Valero}, Math. Comput. Modelling 49, No. 9--10, 1852--1868 (2009; Zbl 1171.03333) Full Text: DOI OpenURL
Lee, Jon; Onn, Shmuel; Weismantel, Robert Nonlinear optimization over a weighted independence system. (English) Zbl 1246.90143 Goldberg, Andrew V. (ed.) et al., Algorithmic aspects in information and management. 5th international conference, AAIM 2009, San Francisco, CA, USA, June 15–17, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02157-2/pbk). Lecture Notes in Computer Science 5564, 251-264 (2009). MSC: 90C30 68Q25 PDF BibTeX XML Cite \textit{J. Lee} et al., Lect. Notes Comput. Sci. 5564, 251--264 (2009; Zbl 1246.90143) Full Text: DOI arXiv Link OpenURL
Diaconis, Persi; Khare, Kshitij; Saloff-Coste, Laurent Gibbs sampling, exponential families and orthogonal polynomials. (English) Zbl 1327.62058 Stat. Sci. 23, No. 2, 151-178 (2008). MSC: 62D05 60E05 60J20 PDF BibTeX XML Cite \textit{P. Diaconis} et al., Stat. Sci. 23, No. 2, 151--178 (2008; Zbl 1327.62058) Full Text: DOI arXiv Euclid OpenURL
Vallée, Thierry; Manning, Joseph Reconstruction of partial orders and list representation as random structures. (English) Zbl 1336.68027 Seda, Anthony (ed.) et al., Proceedings of the Irish conference on the mathematical foundations of computer science and information technology (MFCSIT 2006), National University of Ireland, Cork, Ireland, August 1–5, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 225, 441-456 (2009). MSC: 68N15 06A07 68P05 68Q55 PDF BibTeX XML Cite \textit{T. Vallée} and \textit{J. Manning}, Electron. Notes Theor. Comput. Sci. 225, 441--456 (2008; Zbl 1336.68027) Full Text: DOI OpenURL
Arslan, Abdullah N. An algorithm with linear expected running time for string editing with substitutions and substring reversals. (English) Zbl 1192.68936 Inf. Process. Lett. 106, No. 5, 213-218 (2008). MSC: 68W32 PDF BibTeX XML Cite \textit{A. N. Arslan}, Inf. Process. Lett. 106, No. 5, 213--218 (2008; Zbl 1192.68936) Full Text: DOI OpenURL
Yan, Xingcuan; Yin, Jianping; Cai, Zhiping; Liu, Xianghui An approximate algorithm for minimum vertex cover set of a graph. (Chinese. English summary) Zbl 1199.05312 J. Harbin Inst. Technol. 40, No. 7, 1131-1135 (2008). MSC: 05C85 05C70 68W25 PDF BibTeX XML Cite \textit{X. Yan} et al., J. Harbin Inst. Technol. 40, No. 7, 1131--1135 (2008; Zbl 1199.05312) OpenURL
Casasnovas, J.; Valero, O. A connection between computer science and fuzzy theory: midpoints and running time of computing. (English) Zbl 1163.68323 Mathware Soft Comput. 15, No. 3, 251-261 (2008). MSC: 68Q25 03E72 PDF BibTeX XML Cite \textit{J. Casasnovas} and \textit{O. Valero}, Mathware Soft Comput. 15, No. 3, 251--261 (2008; Zbl 1163.68323) Full Text: EuDML OpenURL
Bernyk, Violetta; Dalang, Robert C.; Peskir, Goran The law of the supremum of a stable Lévy process with no negative jumps. (English) Zbl 1185.60051 Ann. Probab. 36, No. 5, 1777-1789 (2008). MSC: 60G52 45D05 60J75 26A33 PDF BibTeX XML Cite \textit{V. Bernyk} et al., Ann. Probab. 36, No. 5, 1777--1789 (2008; Zbl 1185.60051) Full Text: DOI arXiv OpenURL
Simmons, Robert J.; Pfenning, Frank Linear logical algorithms. (English) Zbl 1155.68349 Aceto, Luca (ed.) et al., Automata, languages and programming. 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7–11, 2008. Proceedings, Part II. Berlin: Springer (ISBN 978-3-540-70582-6/pbk). Lecture Notes in Computer Science 5126, 336-347 (2008). MSC: 68N17 03B70 03F52 68P15 PDF BibTeX XML Cite \textit{R. J. Simmons} and \textit{F. Pfenning}, Lect. Notes Comput. Sci. 5126, 336--347 (2008; Zbl 1155.68349) Full Text: DOI Link OpenURL
D’Abramo, Germano Asymptotic behavior and halting probability of Turing machines. (English) Zbl 1140.68026 Chaos Solitons Fractals 37, No. 1, 210-214 (2008). MSC: 68Q30 68Q05 PDF BibTeX XML Cite \textit{G. D'Abramo}, Chaos Solitons Fractals 37, No. 1, 210--214 (2008; Zbl 1140.68026) Full Text: DOI arXiv OpenURL
Brillinger, David R. Extending the volatility concept to point processes. (English) Zbl 1141.62063 J. Stat. Plann. Inference 138, No. 9, 2607-2614 (2008). MSC: 62M10 60G55 62P10 62M99 91B30 62P05 PDF BibTeX XML Cite \textit{D. R. Brillinger}, J. Stat. Plann. Inference 138, No. 9, 2607--2614 (2008; Zbl 1141.62063) Full Text: DOI Link OpenURL
Lai, Jiyu; Zheng, Jianguo; Zhu, Jiajun; Jiang, Jing Application of Markov process to implementing production running project in the enterprises. (Chinese. English summary) Zbl 1164.60400 Math. Pract. Theory 37, No. 19, 41-45 (2007). MSC: 60J20 91B38 91B26 PDF BibTeX XML Cite \textit{J. Lai} et al., Math. Pract. Theory 37, No. 19, 41--45 (2007; Zbl 1164.60400) OpenURL
Tarkov, Mikhail S.; Bezrukov, Yakov S. Local balancing in a heterogeneous computer system by self-organizing Kohonen network. (English) Zbl 1249.68173 Jt. Bull. NCC IIS, Ser. Comput. Sci. 25, 69-74 (2006). MSC: 68T05 68M14 PDF BibTeX XML Cite \textit{M. S. Tarkov} and \textit{Y. S. Bezrukov}, Jt. Bull. NCC IIS, Ser. Comput. Sci. 25, 69--74 (2006; Zbl 1249.68173) OpenURL
Lee, Mei-Ling Ting; Whitmore, G. A. Threshold regression for survival analysis: modeling event times by a stochastic process reaching a boundary. (English) Zbl 1129.62095 Stat. Sci. 21, No. 4, 501-513 (2006). MSC: 62N99 62N02 60J50 60G99 PDF BibTeX XML Cite \textit{M.-L. T. Lee} and \textit{G. A. Whitmore}, Stat. Sci. 21, No. 4, 501--513 (2006; Zbl 1129.62095) Full Text: DOI arXiv Euclid OpenURL
Colin de Verdiére, Éric; Lazarus, Francis Optimal system of loops on an orientable surface. (English) Zbl 1076.57018 Discrete Comput. Geom. 33, No. 3, 507-534 (2005). Reviewer: Maria Rita Casali (Modena) MSC: 57N05 57-04 57Q05 05C85 05C12 PDF BibTeX XML Cite \textit{É. Colin de Verdiére} and \textit{F. Lazarus}, Discrete Comput. Geom. 33, No. 3, 507--534 (2005; Zbl 1076.57018) Full Text: DOI OpenURL
Suzuki, Susumu; Ibara, Toshihide An average running time analysis of a backtracking algorithm to calculate the size of the union of Cartesian products. (English) Zbl 1101.68611 Informatica, Ljubl. 28, No. 3, 227-232 (2004). MSC: 68Q25 PDF BibTeX XML Cite \textit{S. Suzuki} and \textit{T. Ibara}, Informatica, Ljubl. 28, No. 3, 227--232 (2004; Zbl 1101.68611) OpenURL
Laumanns, Marco; Thiele, Lothar; Zitzler, Eckart Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem. (English) Zbl 1074.68065 Nat. Comput. 3, No. 1, 37-51 (2004). MSC: 68T20 68T05 90C29 90C59 PDF BibTeX XML Cite \textit{M. Laumanns} et al., Nat. Comput. 3, No. 1, 37--51 (2004; Zbl 1074.68065) Full Text: DOI OpenURL
Matsumoto, Makoto; Tagami, Shigehiro Practical fast algorithm for finite field arithmetics using group rings. (English) Zbl 1059.11074 Hiroshima Math. J. 34, No. 2, 201-210 (2004). Reviewer: Juan Tena Ayuso (Valladolid) MSC: 11Y16 11T71 PDF BibTeX XML Cite \textit{M. Matsumoto} and \textit{S. Tagami}, Hiroshima Math. J. 34, No. 2, 201--210 (2004; Zbl 1059.11074) OpenURL
Kou, S. G.; Wang, Hui First passage times of a jump diffusion process. (English) Zbl 1037.60073 Adv. Appl. Probab. 35, No. 2, 504-531 (2003). Reviewer: Ilya Pavlyukevitch (Berlin) MSC: 60J75 44A10 60J27 60G51 PDF BibTeX XML Cite \textit{S. G. Kou} and \textit{H. Wang}, Adv. Appl. Probab. 35, No. 2, 504--531 (2003; Zbl 1037.60073) Full Text: DOI OpenURL
Dobrow, Robert P.; Fill, James Allen Speeding up the FMMR perfect sampling algorithm: A case study revisited. (English) Zbl 1042.65014 Random Struct. Algorithms 23, No. 4, 434-452 (2003). Reviewer: Laszlo Lakatos (Budapest) MSC: 65C40 62D05 65C05 60J22 65C50 PDF BibTeX XML Cite \textit{R. P. Dobrow} and \textit{J. A. Fill}, Random Struct. Algorithms 23, No. 4, 434--452 (2003; Zbl 1042.65014) Full Text: DOI arXiv Link OpenURL
Bae, Joonwoo; Kwon, Younghun Perturbations can enhance quantum search. (English) Zbl 1037.81011 Int. J. Theor. Phys. 42, No. 9, 2075-2080 (2003). MSC: 81P68 PDF BibTeX XML Cite \textit{J. Bae} and \textit{Y. Kwon}, Int. J. Theor. Phys. 42, No. 9, 2075--2080 (2003; Zbl 1037.81011) Full Text: DOI arXiv OpenURL
Suzuki, Susumu; Ibaraki, Toshihide Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. (English) Zbl 1041.68051 Discrete Math. 273, No. 1-3, 211-220 (2003). MSC: 68Q25 PDF BibTeX XML Cite \textit{S. Suzuki} and \textit{T. Ibaraki}, Discrete Math. 273, No. 1--3, 211--220 (2003; Zbl 1041.68051) Full Text: DOI OpenURL
Fleischer, Lisa; Iwata, Satoru A push-relabel framework for submodular function minimization and applications to parametric optimization. (English) Zbl 1030.90097 Discrete Appl. Math. 131, No. 2, 311-322 (2003). MSC: 90C27 90C31 68W40 PDF BibTeX XML Cite \textit{L. Fleischer} and \textit{S. Iwata}, Discrete Appl. Math. 131, No. 2, 311--322 (2003; Zbl 1030.90097) Full Text: DOI OpenURL
Teske, Edlyn Computing discrete logarithms with the parallelized kangaroo method. (English) Zbl 1044.11107 Discrete Appl. Math. 130, No. 1, 61-82 (2003). Reviewer: Juan Tena Ayuso (Valladolid) MSC: 11Y16 94A60 PDF BibTeX XML Cite \textit{E. Teske}, Discrete Appl. Math. 130, No. 1, 61--82 (2003; Zbl 1044.11107) Full Text: DOI OpenURL
Maraninchi, Florence; Rémond, Yann Mode-automata: A new domain-specific construct for the development of safe critical systems. (English) Zbl 1051.68097 Sci. Comput. Program. 46, No. 3, 219-254 (2003). MSC: 68Q45 PDF BibTeX XML Cite \textit{F. Maraninchi} and \textit{Y. Rémond}, Sci. Comput. Program. 46, No. 3, 219--254 (2003; Zbl 1051.68097) Full Text: DOI OpenURL
Dogaru, Roxana; Dogaru, Octavian On some straight string search algorithms. (English) Zbl 1121.68470 Trîmbiţaş, Radu T. (ed.), Proceedings of the international symposium on numerical analysis and approximation theory, Cluj-Napoca, Romania, May 9–11, 2002. Dedicated to the 75th anniversary of Professor Dr. Dimitrie D. Stancu, honorary member of the Romanian Academy. Cluj-Napoca: Cluj University Press (ISBN 973-610-166-5/pbk). 177-186 (2002). MSC: 68W40 68W05 PDF BibTeX XML Cite \textit{R. Dogaru} and \textit{O. Dogaru}, in: Proceedings of the international symposium on numerical analysis and approximation theory, Cluj-Napoca, Romania, May 9--11, 2002. Dedicated to the 75th anniversary of Professor Dr. Dimitrie D. Stancu, honorary member of the Romanian Academy. Cluj-Napoca: Cluj University Press. 177--186 (2002; Zbl 1121.68470) OpenURL
Lopez, Mario A.; Reisner, Shlomo Linear time approximation of 3D convex polytopes. (English) Zbl 1015.52013 Comput. Geom. 23, No. 3, 291-301 (2002). MSC: 52B55 PDF BibTeX XML Cite \textit{M. A. Lopez} and \textit{S. Reisner}, Comput. Geom. 23, No. 3, 291--301 (2002; Zbl 1015.52013) Full Text: DOI OpenURL
Puchta, Jan-Christoph Representation of numbers with negative digits and multiplication of small integers. (English) Zbl 1012.11010 Fibonacci Q. 40, No. 1, 66-67 (2002). Reviewer: László Tóth (Pecs) MSC: 11A67 68W30 PDF BibTeX XML Cite \textit{J.-C. Puchta}, Fibonacci Q. 40, No. 1, 66--67 (2002; Zbl 1012.11010) OpenURL
Suzuki, Susumu; Ibaraki, Toshihide Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. (English) Zbl 1184.68272 Nešetřil, Jaroslav (ed.) et al., Comb01—Euroconference on combinatorics, graph theory and applications. Extended abstracts from the conference, Barcelona, Spain, September 12–15, 2001. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 10, 272-276 (2001). MSC: 68Q25 05A05 68W40 PDF BibTeX XML Cite \textit{S. Suzuki} and \textit{T. Ibaraki}, Electron. Notes Discrete Math. 10, 272--276 (2001; Zbl 1184.68272) Full Text: DOI OpenURL
Enge, Andreas A general framework for subexponential discrete logarithm algorithms in groups of unknown order. (English) Zbl 1015.11067 Blokhuis, A. (ed.) et al., Finite geometries. Proceedings of the fourth Isle of Thorns conference, Brighton, UK, April 2000. Dordrecht: Kluwer Academic Publishers. Dev. Math. 3, 133-146 (2001). MSC: 11Y16 68W30 94A60 PDF BibTeX XML Cite \textit{A. Enge}, Dev. Math. 3, 133--146 (2001; Zbl 1015.11067) OpenURL