On the public citation graph

Denotational recurrence extraction for amortized analysis

0 signed · 49 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-319-30936-1_12openalex-snapshot

I Got Plenty o’ Nuttin’

inferredcites →https://doi.org/10.1007/978-3-319-48989-6_16openalex-snapshot

Upper and Lower Amortized Cost Bounds of Programs Expressed as Cost Relations

inferredcites →https://doi.org/10.1007/978-3-642-33125-1_27openalex-snapshot

On the Limits of the Classical Approach to Cost Analysis

inferredcites →https://doi.org/10.1007/978-3-662-46669-8_6openalex-snapshot

Automatic Static Cost Analysis for Parallel Programs

inferredcites →https://doi.org/10.1007/s10817-010-9174-1openalex-snapshot

Closed-Form Upper Bounds in Static Cost Analysis

inferredcites →https://doi.org/10.1007/s10817-016-9398-9openalex-snapshot

Type-Based Cost Analysis for Lazy Functional Languages

inferredcites →https://doi.org/10.1016/0304-3975(92)90386-topenalex-snapshot

Bounded linear logic: a modular approach to polynomial-time computability

inferredcites →https://doi.org/10.1016/j.tcs.2003.10.022openalex-snapshot

Automated higher-order complexity analysis

inferredcites →https://doi.org/10.1016/j.tcs.2011.07.009openalex-snapshot

Cost analysis of object-oriented bytecode programs

inferredcites →https://doi.org/10.1016/s0890-5401(03)00009-9openalex-snapshot

Linear types and non-size-increasing polynomial time computation

inferredcites →https://doi.org/10.1017/cbo9780511530104openalex-snapshot

Purely Functional Data Structures

inferredcites →https://doi.org/10.1017/s095679682200003xopenalex-snapshot

Denotational semantics as a foundation for cost recurrence extraction for functional languages

inferredcites →https://doi.org/10.1137/0606031openalex-snapshot

Amortized Computational Complexity

inferredcites →https://doi.org/10.1145/1328438.1328457openalex-snapshot

Lightweight semiformal time complexity analysis for purely functional data structures

inferredcites →https://doi.org/10.1145/2362389.2362393openalex-snapshot

Multivariate amortized resource analysis

inferredcites →https://doi.org/10.1145/2428116.2428123openalex-snapshot

A static cost analysis for a higher-order language

inferredcites →https://doi.org/10.1145/2499937.2499943openalex-snapshot

On the Inference of Resource Usage Upper and Lower Bounds

inferredcites →https://doi.org/10.1145/2784731.2784749openalex-snapshot

Denotational cost semantics for functional languages with inductive types

inferredcites →https://doi.org/10.1145/3009837.3009842openalex-snapshot

Towards automatic resource bound analysis for OCaml

inferredcites →https://doi.org/10.1145/3133903openalex-snapshot

TiML: a functional language for practical complexity analysis with invariants

inferredcites →https://doi.org/10.1145/3158142openalex-snapshot

Non-linear reasoning for invariant synthesis

inferredcites →https://doi.org/10.1145/318593.318606openalex-snapshot

Abstract types have existential types

inferredcites →https://doi.org/10.1145/3209108.3209189openalex-snapshot

Syntax and Semantics of Quantitative Type Theory

inferredcites →https://doi.org/10.1145/3314221.3314602openalex-snapshot

Resource-guided program synthesis

inferredcites →https://doi.org/10.1145/3341714openalex-snapshot

Quantitative program reasoning with graded modal types

inferredcites →https://doi.org/10.1145/3371083openalex-snapshot

Recurrence extraction for functional programs through call-by-push-value

inferredcites →https://doi.org/10.1145/361002.361016openalex-snapshot

Mechanical program analysis

inferredcites →https://doi.org/10.1145/3828.3835openalex-snapshot

Self-adjusting binary search trees

inferredcites →https://doi.org/10.1145/42190.42347openalex-snapshot

ACE: an automatic complexity evaluator

inferredcites →https://doi.org/10.1145/503272.503297openalex-snapshot

The strength of non-size increasing computation

inferredcites →https://doi.org/10.1145/604131.604148openalex-snapshot

Static prediction of heap space usage for first-order functional programs

inferredcites →https://doi.org/10.1145/99370.99381openalex-snapshot

Automatic complexity analysis

inferredcites →https://doi.org/10.14418/wes01.2.116openalex-snapshot

Computer-Checked Recurrence Extraction for Functional Programs

inferredcites →https://doi.org/10.2168/lmcs-3(1:9)2007openalex-snapshot

Adventures in time and space

inferredcites →https://doi.org/10.29007/xkwxopenalex-snapshot

Automatic Space Bound Analysis for Functional Programs with Garbage Collection

inferredcites →https://doi.org/10.4230/lipics.fscd.2017.25openalex-snapshot

A Fibrational Framework for Substructural and Modal Logics

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_17openalex-snapshot

The Memorist Tale: Every Thunk Every Cost All At Once

inferred← citeshttps://doi.org/10.1017/s0956796821000071openalex-snapshot

Relational cost analysis in a functional-imperative setting

inferred← citeshttps://doi.org/10.1017/s095679682200003xopenalex-snapshot

Denotational semantics as a foundation for cost recurrence extraction for functional languages

inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175720openalex-snapshot

Automatic Amortized Resource Analysis with Regular Recursive Types

inferred← citeshttps://doi.org/10.1145/3473581openalex-snapshot

Automatic amortized resource analysis with the Quantum physicist’s method

inferred← citeshttps://doi.org/10.1145/3473585openalex-snapshot

Reasoning about the garden of forking paths

inferred← citeshttps://doi.org/10.1145/3473592openalex-snapshot

On continuation-passing transformations and expected cost analysis

inferred← citeshttps://doi.org/10.1145/3485515openalex-snapshot

Dynaplex: analyzing program complexity using dynamically inferred recurrence relations

inferred← citeshttps://doi.org/10.1145/3656380openalex-snapshot

Robust Resource Bounds with Static Analysis and Bayesian Inference

inferred← citeshttps://doi.org/10.1145/3674626openalex-snapshot

Story of Your Lazy Function’s Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy Programs

inferred← citeshttps://doi.org/10.1145/3720424openalex-snapshot

Denotational Foundations for Expected Cost Analysis

inferred← citeshttps://doi.org/10.1145/3763798openalex-snapshot

Integrating Resource Analyses via Resource Decomposition

inferred← citeshttps://doi.org/10.46298/lmcs-20(4:26)2024openalex-snapshot

Worst-Case Input Generation for Concurrent Programs under Non-Monotone Resource Metrics

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.