SoK: Deep Packer Inspection: A Longitudinal Study of the Complexity of Run-Time Packers Xabier Ugarte-Pedrero∗ , Davide Balzarotti† , Igor Santos∗ , Pablo G. Bringas∗ ∗ DeustoTech, University of Deusto

Source URL: s3.eurecom.fr

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

Source URL: www.chargueraud.org

J Real-Time Image Proc:5–24 DOIs11554SPECIAL ISSUE PAPER Complexity control of HEVC encoders targeting real-time

Source URL: cesweb.itec.kit.edu

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

Source URL: chargueraud.org

• Software engineering
• Computer programming
• Computing
• Functional languages
• Data types
• Type theory
• Logic in computer science
• Automated theorem proving
• OCaml
• Coq
• Disjoint-set data structure
• Proof assistant

A Gentle Introduction to the Time Complexity Analysis of Evolutionary Algorithms Pietro S. Oliveto Department of Computer Science The University of Sheffield, Sheffield, UK email:

Source URL: www.conference123.org

The “Jump-counting” Skipfield Pattern A replacement for boolean skipfields yielding O(n) time complexity for iteration over unskipped elements Matthew Bentley

Source URL: plflib.org

Time Complexity Analysis of the Stochastic Diffusion Search † Slawomir J.Nasuto, ‡Mark J.Bishop and $Stanislao Lauria Department of Cybernetics, Neural Networks Research Group,

Source URL: www.doc.gold.ac.uk

Journal of Artificial Intelligence Research234 Submitted 8/14; published 1/15 On the Subexponential-Time Complexity of CSP Ronald de Haan

Source URL: jair.org

The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th

Source URL: ciim.usf.edu

On the Computational Complexity of Periodic Scheduling PhD defense Thomas Rothvoß Real-time Scheduling

Source URL: www.math.washington.edu