FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

B
Bhaskar, Siddharth	Computability over locally finite structures from algebra
Bojanczyk, Mikolaj	On polynomial time for infinite structures
D
Dal Lago, Ugo	Characterizing Complexity Classes in Presence of Higher-Order Functions — How Martin Hofmann Contributed to Shaping ICC
Das, Anupam	A recursion-theoretic characterisation of the positive polynomial-time functions
H
Hermenegildo, Manuel V.	A General Equational Framework for Static Profiling of Parametric Resource Usage
J
Jost, Steffen	Static Prediction of Heap Space Usage for First-Order Functional Programs -- A Retrospective on my First Paper with Martin Hofmann
K
Klemen, Maximiliano	A General Equational Framework for Static Profiling of Parametric Resource Usage
L
Lindell, Steven	Traversal-invariant definability and Logarithmic-space computation
Liqat, Umer	A General Equational Framework for Static Profiling of Parametric Resource Usage
Lopez-Garcia, Pedro	A General Equational Framework for Static Profiling of Parametric Resource Usage
M
Müller, Moritz	Feasibly constructive proofs of succinct weak circuit lower bounds
N
Nigam, Vivek	My Journey through Observational Equivalence Research with Martin Hofmann
O
Oitavem, Isabel	A recursion-theoretic characterisation of the positive polynomial-time functions
P
Pich, Ján	Feasibly constructive proofs of succinct weak circuit lower bounds
Pin, Edwin	Completeness in the Second Level of the Polynomial Time Hierarchy through Syntactic Properties
S
Sannella, Don	Memories of Martin
W
Weinstein, Scott	Traversal-invariant definability and Logarithmic-space computation

Disclaimer | Powered by EasyChair Smart Program