Search

Your search keyword '"Mattern, Friedemann"' showing total 158 results

Search Constraints

Start Over You searched for: Author "Mattern, Friedemann" Remove constraint Author: "Mattern, Friedemann" Publication Year Range Last 3 years Remove constraint Publication Year Range: Last 3 years
158 results on '"Mattern, Friedemann"'

Search Results

1. It’s All a Game : Apartness and Bisimilarity

2. Learning Guided Automated Reasoning: A Brief Survey

3. Some Probabilistic Riddles and Some Logical Solutions

4. A Variation of Reynolds-Hurkens Paradox

5. YACC: Yet Another Church Calculus : A Birthday Present for Herman Inspired by His Supervisor Activity

6. Between Brackets

7. Integer Points in Arbitrary Convex Cones: The Case of the PSD and SOC Cones

8. Safe Smooth Paths Between Straight Line Obstacles

9. Approximation Fixpoint Theory in Coq : With an Application to Logic Programming

10. Constructing Morphisms for Arithmetic Subsequences of Fibonacci

11. Sequential Value Passing Yields a Kleene Theorem for Processes

12. Characterizing Morphic Sequences

13. A New Perspective on Conformance Testing Based on Apartness

14. The Interval Domain in Homotopy Type Theory

15. Relating Apartness and Branching Bisimulation Games

16. Multisets and Distributions

17. Fixed Point Theorems in Computability Theory

18. Minimal Depth Distinguishing Formulas Without Until for Branching Bisimulation

19. The Extension Complexity of Polytopes with Bounded Integral Slack Matrices

20. Von Neumann-Morgenstern Stability and Internal Closedness in Matching Theory

21. Approximately Packing Dijoins via Nowhere-Zero Flows

22. A First Order Method for Linear Programming Parameterized by Circuit Imbalance

23. Capacitated Facility Location with Outliers and Uniform Facility Costs

24. A Better-Than-1.6-Approximation for Prize-Collecting TSP

25. On Matrices over a Polynomial Ring with Restricted Subdeterminants

26. Separating from the Supplier Version

27. Sensitivity Analysis for Mixed Binary Quadratic Programming

28. Online Algorithms for Spectral Hypergraph Sparsification

29. Relaxation Strength for Multilinear Optimization: McCormick Strikes Back

30. Fast Combinatorial Algorithms for Efficient Sortation

31. A New Branching Rule for Range Minimization Problems

32. Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack

33. A -Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs

34. Extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families

35. Network Flow Problems with Electric Vehicles

36. Polynomial Algorithms to Minimize 2/3-Submodular Functions

37. Decomposing Probability Marginals Beyond Affine Requirements

38. Online Combinatorial Assignment in Independence Systems

39. On the Congruency-Constrained Matroid Base

40. Sparsity and Integrality Gap Transference Bounds for Integer Programs

41. Pairwise-Independent Contention Resolution

42. On the Partial Convexification of the Low-Rank Spectral Optimization: Rank Bounds and Algorithms

43. Tight Lower Bounds for Block-Structured Integer Programs

44. An FPTAS for Connectivity Interdiction

45. On the Number of Degenerate Simplex Pivots

46. Fully-Dynamic Load Balancing

47. Adaptivity Gaps in Two-Sided Assortment Optimization

48. Two-Stage Stochastic Stable Matching

49. A Lower Bound for the Max Entropy Algorithm for TSP

50. Assortment Optimization with Visibility Constraints

Catalog

Books, media, physical & digital resources