Logic List Mailing Archive

CfP: AMMA2024: Abstract Methods in Multivariate Algorithmics, Aug 12-16, Gainesville (Florida / USA)

Dear colleagues,
I am pleased to announce a new conference series focused on the interactions of categorical abstractions and algorithmic theory. The conference will run from the 12th to the 16th of August and it will be held at the University of Florida (Gainesville, FL). Abstract submission is now open and you can find details of the conference here<https://gataslab.org/amma> : https://gataslab.org/amma . I look forward to seeing many of you there!
________________________________
The Abstract Methods in Multivariate Algorithmics (AMMA) is an international workshop bringing together two mathematical communities: (1) researchers in parameterized (multivariate) complexity theory and (2) researchers in applied topology and category theory. The two communities share many core goals such as understanding compositional systems and compositional algorithms and the systematic confinement of emergent complexity (such as combinatorial explosion). The workshop will consist of a blend of invited and contributed talks as well as tutorials on parameterized complexity and applied category theory aiming to bridge the mathematical and linguistic gap between the two communities.
The topics may include but are not limited to:
*         Sheaves and dynamic programming
*         Well-quasi-ordering and encountered-instance algorithmic frameworks beyond worst-case analysis
*         Universal obstructions in graph structural width metrics and a general theory of such metrics
*         Abstract approaches to second-order Myhill-Nerode congruences and beyond
*         Diagram-completion paradigms in parameterized complexity such as solution diversity,
*         Transfer learning and dynamic input
*         General theories of purposeful kernelization
*         Parameterizing on quantization
*         Inductive gradients in parameterized algorithms
*         Problem-specific well quasi-ordering and functorial approaches to parameterized complexity classification
*         Abstract views of input normal forms such as graphs as lineal topologies
*         Abstract models of computation appropriate to truly linear FPT (O(n) + f(k)) algorithmics
*         Abstract models of graphs arising from data points plus metric knobs, and their natural decompositions.






If you have any questions, feel free to contact any member of the organising committee:
- Benjamin Merlin Bumpus
- Michael R. Fellows
- Frances A. Rosamond
- James P. Fairbanks


We look forward to seeing many of you there!


---------
Benjamin Merlin Bumpus PhD, Mathematician and Computer Scientist.
Faculty Research Scientist, GATAS lab, University of Florida.

Visit my blog ( https://bmbumpus.com/ )  for information about my research interests, CV and more.

For information about Algebraic Julia, visit: https://www.algebraicjulia.org/

--
[LOGIC] mailing list, provided by DLMPST
More information (including information about subscription management) can
be found here: http://dlmpst.org/pages/logic-list.php