default search action

combined dblp search
author search
venue search
publication search

ask others

Julian Biendarra

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

2019
[j2]
- view
  - electronic edition @ isa-afp.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/afp/HaslbeckLB19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/afp/HaslbeckLB19
Maximilian P. L. Haslbeck, Peter Lammich, Julian Biendarra:
Kruskal's Algorithm for Minimum Spanning Forest. Arch. Formal Proofs 2019 (2019)
2017
[j1]
- view
  - electronic edition @ isa-afp.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/afp/BiendarraE17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/afp/BiendarraE17
Julian Biendarra, Manuel Eberl:
Bertrand's postulate. Arch. Formal Proofs 2017 (2017)

Conference and Workshop Papers

see FAQ

What is the meaning of the colors in the publication lists?

2017
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/frocos/BiendarraBBDFHK17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/frocos/BiendarraBBDFHK17
Julian Biendarra, Jasmin Christian Blanchette, Aymeric Bouzy, Martin Desharnais, Mathias Fleury, Johannes Hölzl, Ondrej Kuncar, Andreas Lochbihler, Fabian Meier, Lorenz Panny, Andrei Popescu, Christian Sternagel, René Thiemann, Dmitriy Traytel:
Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic. FroCoS 2017: 3-21

Coauthor Index

see FAQ

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.