Výsledky vyhledávání - 68W40: Analysis of algorithms

Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm

Autoři: Becchetti, Luca Leonardi, Stefano Marchetti-Spaccamela, Alberto a další

Zdroj: Mathematics of Operations Research, 2006 Feb 01. 31(1), 85-108.

Přístupová URL adresa: https://www.jstor.org/stable/25151708

Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems

Autoři: van Zuylen, Anke Williamson, David P.

Zdroj: Mathematics of Operations Research, 2009 Aug 01. 34(3), 594-620.

Přístupová URL adresa: https://www.jstor.org/stable/40538434

Online Primal-Dual Algorithms for Covering and Packing

Autoři: Buchbinder, Niv

Zdroj: Mathematics of Operations Research, 2009 May 01. 34(2), 270-286.

Přístupová URL adresa: https://www.jstor.org/stable/40538382

Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems

Autoři: Chuzhoy, Julia Ostrovsky, Rafail Rabani, Yuval

Zdroj: Mathematics of Operations Research, 2006 Nov 01. 31(4), 730-738.

Přístupová URL adresa: https://www.jstor.org/stable/25151758

Searchable encryption with randomized ciphertext and randomized keyword search

Autoři: Calderini Marco Longo Riccardo Sala Massimiliano a další

Zdroj: Journal of Mathematical Cryptology, Vol 18, Iss 1, Pp 506-22 (2024)

Témata: searchable encryption, paeks scheme, cloud cryptography, bilinear pairings, 94a60 cryptography, 14h52 elliptic curves, 94a62, authentication and secret sharing, 68w40 analysis of algorithms, Mathematics, QA1-939

Popis souboru: electronic resource

Relation: https://doaj.org/toc/1862-2984

Přístupová URL adresa: https://doaj.org/article/f166e02decb84c07b88e1d5d2d2d4c89

Online k-taxi via Double Coverage and time-reverse primal-dual.

Autoři: Buchbinder, Niv Coester, Christian Naor, Joseph

Zdroj: Mathematical Programming. Feb2023, Vol. 197 Issue 2, p499-527. 29p.

Témata: *ALGORITHMS, ONLINE algorithms, DETERMINISTIC algorithms, METRIC spaces, INTEGERS

Provably Unforgeable Threshold EdDSA with an Offline Participant and Trustless Setup

Autoři: Battagliola, M Longo, R Meneghetti, A a další

Přispěvatelé: Battagliola, M Longo, R Meneghetti, A a další

Zdroj: Mediterranean Journal of Mathematics. 20

Témata: 0211 other engineering and technologies, 94A60 cryptography, 12E20 finite fields, 14h52 elliptic curves, 94A62 authentication and secret sharing, 68w40 analysis of algorithms, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://link.springer.com/article/10.1007/s00009-023-02452-9#citeas
https://hdl.handle.net/11572/384212
https://doi.org/10.1007/s00009-023-02452-9

Elementary Yet Precise Worst-case Analysis of MergeSort, A short version (SV)

Autoři: Suchenek, Marek A.

Témata: FOS: Computer and information sciences, 68W40 Analysis of algorithms, Discrete Mathematics (cs.DM), G.2.0, G.2.1, G.2.2, 0102 computer and information sciences, Computational Complexity (cs.CC), F.2.2, 01 natural sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computer Science - Discrete Mathematics

Přístupová URL adresa: http://arxiv.org/abs/1702.08443

On the Maximum Quadratic Assignment Problem

Autoři: Nagarajan, Viswanath Sviridenko, Maxim

Zdroj: Mathematics of Operations Research, 2009 Nov 01. 34(4), 859-868.

Přístupová URL adresa: https://www.jstor.org/stable/40538403

A Provably-Unforgeable Threshold Schnorr Signature With an Offline Recovery Party

Autoři: Battagliola, Michele Galli, Alessio Longo, Riccardo a další

Přispěvatelé: Battagliola, Michele Galli, Alessio Longo, Riccardo a další

Témata: 94A60 cryptography, 12E20 finite fields, 14H52 elliptic curves, 94A62 authentication and secret sharing, 68W40 analysis of algorithms

Relation: ispartofbook:CEUR Workshop Proceedings - 4th Workshop on Distributed Ledger Technology, DLT 2022; DLT 2022; volume:3166; firstpage:60; lastpage:76; numberofpages:17; serie:CEUR WORKSHOP PROCEEDINGS; alleditors:Pizzonia, Maurizio; Vitaletti, Andrea; https://hdl.handle.net/11572/378871

Dostupnost: https://hdl.handle.net/11572/378871

Analysis of a first-fit algorithm for the capacitated unit covering problem.

Autoři: Ghasemi, Taha Razzazi, Mohammadreza

Zdroj: International Journal of Computer Mathematics. Jul2017, Vol. 94 Issue 7, p1375-1389. 15p.

Témata: Approximation algorithms, Bin packing problem, Computational complexity, Cutting stock problem, Computational geometry

On the Undecidability of Computing Stationary Distributions and Large Deviation Rates for Constrained Random Walks

Autoři: Gamarnik, David

Zdroj: Mathematics of Operations Research, 2007 May 01. 32(2), 257-265.

Přístupová URL adresa: https://www.jstor.org/stable/25151787

On the Integrality Ratio for the Asymmetric Traveling Salesman Problem

Autoři: Charikar, Moses Goemans, Michel X. Karloff, Howard

Zdroj: Mathematics of Operations Research, 2006 May 01. 31(2), 245-252.

Přístupová URL adresa: https://www.jstor.org/stable/25151722

Threshold ECDSA with an Offline Recovery Party

Autoři: Battagliola M. Longo R. Meneghetti A. a další

Zdroj: Mediterranean Journal of Mathematics. 19

Témata: FOS: Computer and information sciences, Computer Science - Cryptography and Security, 0202 electrical engineering, electronic engineering, information engineering, 12E20 finite fields, 14H52 elliptic curves, 68W40 analysis of algorithms, 94A60 cryptography, 94A62 authentication and secret sharing, 0102 computer and information sciences, 02 engineering and technology, Cryptography and Security (cs.CR), 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://iris.unitn.it/bitstream/11572/327419/1/Battagliola2021_Article_ThresholdECDSAWithAnOfflineRec.pdf
http://arxiv.org/abs/2007.04036
https://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-04036
https://link.springer.com/article/10.1007%2Fs00009-021-01886-3
https://arxiv.org/abs/2007.04036
https://hdl.handle.net/11572/327419
https://link.springer.com/article/10.1007/s00009-021-01886-3#citeas
https://doi.org/10.1007/s00009-021-01886-3

Refined Analysis of the Asymptotic Complexity of the Number Field Sieve

Autoři: Le Gluher, Aude Spaenlehauer, Pierre-Jean Thomé, Emmanuel a další

Přispěvatelé: Le Gluher, Aude Spaenlehauer, Pierre-Jean Thomé, Emmanuel a další

Zdroj: Mathematical Cryptology ; https://inria.hal.science/hal-02934273 ; Mathematical Cryptology, 2021, 1 (1), pp.71-88. ⟨10.48550/arXiv.2007.02730⟩ ; https://journals.flvc.org/mathcryptology/article/view/125488

Témata: Complexity, Asymptotic optimization, Number Field Sieve, 68W40 (Analysis of algorithms), 11Y05 (Factorization), [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2007.02730; ARXIV: 2007.02730

Dostupnost: https://inria.hal.science/hal-02934273
https://doi.org/10.48550/arXiv.2007.02730

Optimal online k-min search

Autoři: Javeria Iqbal Iftikhar Ahmad

Zdroj: EURO Journal on Computational Optimization, Vol 3, Iss 2, Pp 147-160 (2015)

Témata: 68W40 Analysis of algorithms, T57-57.97, Applied mathematics. Quantitative methods, Electronic computers. Computer science, 0202 electrical engineering, electronic engineering, information engineering, 68W27 Online algorithms, QA75.5-76.95, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Přístupová URL adresa: https://doaj.org/article/3f9eb8d0419d47439ca1701b96211a34
https://link.springer.com/article/10.1007/s13675-014-0031-6
https://dblp.uni-trier.de/db/journals/ejco/ejco3.html#IqbalA15
https://doi.org/10.1007/s13675-014-0031-6
https://www.infona.pl/resource/bwmeta1.element.springer-204e14d9-fc8e-3d86-b164-fec7ca85b38f
https://link.springer.com/content/pdf/10.1007%2Fs13675-014-0031-6.pdf

Towards a Realistic Analysis of Some Popular Sorting Algorithms

Autoři: Clément, Julien Nguyen Thi, Thu Hien Vallée, Brigitte a další

Přispěvatelé: Clément, Julien Nguyen Thi, Thu Hien Vallée, Brigitte a další

Zdroj: Combinatorics, Probability and Computing. 24:104-144

Témata: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], 68Q87, 68P10, 68Q17Secondary 68W05, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.6: Sorting and searching, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 68Q25, 68W40, 94A17, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 68P05, 94A15, 01 natural sciences, 30D10, 30E20, 30E15, 97I80, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], 0101 mathematics, Primary 68W32

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01103998/file/cpc-PF-style.pdf
https://dblp.uni-trier.de/db/journals/cpc/cpc24.html#ClementTV15
https://hal.archives-ouvertes.fr/hal-01103998

Convergence of the QuickVal residual

Autoři: James Allen Fill Jason Matterer

Zdroj: Combinatorics, Probability and Computing. :1-23

Témata: FOS: Computer and information sciences, Data Structures and Algorithms, Probability (math.PR), FOS: Mathematics, Data Structures and Algorithms (cs.DS), Probability, 60F05 (Primary) 68W40 (Secondary)

Přístupová URL adresa: http://arxiv.org/abs/2412.12599

Existence of a limiting distribution for the binary GCD algorithm

Autoři: Gérard Maze

Zdroj: Journal of Discrete Algorithms. 5:176-186

Témata: Binary gcd algorithm, Fixed point, 0102 computer and information sciences, 01 natural sciences, Theoretical Computer Science, Functional Analysis (math.FA), 68W40, 68Q25, 47H10, Mathematics - Functional Analysis, Computational Theory and Mathematics, General Mathematics (math.GM), 0103 physical sciences, FOS: Mathematics, Discrete Mathematics and Combinatorics, Analysis of algorithms, Mathematics - General Mathematics

Přístupová URL adresa: http://arxiv.org/abs/math/0504426
https://dblp.uni-trier.de/db/journals/jda/jda5.html#Maze07
https://core.ac.uk/display/82094294
https://www.sciencedirect.com/science/article/pii/S157086670600027X
http://user.math.uzh.ch/maze/Articles/BrentArxiv.pdf

Singularity analysis, Hadamard products, and tree recurrences

Autoři: Nevin Kapur James Allen Fill Philippe Flajolet

Zdroj: Journal of Computational and Applied Mathematics. 174:271-313

Témata: Singularity analysis, Moment pumping, Shape functional, 05A16 (Primary), 0102 computer and information sciences, Contour integration, 01 natural sciences, Inversion theorems, FOS: Mathematics, Mathematics - Combinatorics, Analysis of algorithms, 0101 mathematics, Divide-and-conquer, Applied Mathematics, Probability (math.PR), Hadamard products, 16. Peace & justice, Asymptotic enumeration, Generating functions, Generalized polylogarithm, Computational Mathematics, Asymptotic expansions, 40E99, 68W40 (Secondary), Tree recurrences, Combinatorics (math.CO), Mathematics - Probability

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/math/0306225
https://arxiv.org/abs/math/0306225
http://ui.adsabs.harvard.edu/abs/2005JCoAM.174..271F/abstract
https://www.sciencedirect.com/science/article/pii/S0377042704002171
https://arxiv.org/pdf/math/0306225v1
https://www.sciencedirect.com/science/article/abs/pii/S0377042704002171
https://www.ams.jhu.edu/~fill/papers/Hadamard.pdf