PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Rossman, Benjamin"

Author of the publication

copydeleteadd this publication to your clipboard
Interactive Small-Step Algorithms I: Axiomatization.

, , , and . Logical Methods in Computer Science, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Benjamin Bätz University of Stuttgart

Benjamin Weder University of Stuttgart

Execution Patterns for Quantum Applications, , , , , , , and . Proceedings of the 18th International Conference on Software Technologies, page 258-268. Setúbal, SciTePress, (2023)

Benjamin Schoch University of Stuttgart

Lessons Learned and First Results of the E-Band CubeSat EIVE, , , , , , , , , and 17 other author(s). Preprint, (2023)

Jun. -Prof. Dr. rer. nat. Benjamin Uekermann University of Stuttgart

System Regression Tests for the preCICE Coupling Ecosystem, , and . deRSE24 - Selected Contributions of the 4th Conference for Research Software Engineering in Germany, (2025)

Benjamin Kaiser University of Stuttgart

 

Other publications of authors with the same name

The Monotone Complexity of k-Clique on Random Graphs.. SIAM J. Comput., 43 (1): 256-279 (2014)An O(n^3)-Time Algorithm for Tree Edit Distance, , , and . CoRR, (2006)A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs.. WoLLIC, volume 7456 of Lecture Notes in Computer Science, page 282-290. Springer, (2012)Choiceless Computation and Symmetry.. Fields of Logic and Computation, volume 6300 of Lecture Notes in Computer Science, page 565-580. Springer, (2010)Subspace-Invariant AC^0 Formulas.. ICALP, volume 80 of LIPIcs, page 93:1-93:11. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)The Query Complexity of Witness Finding., , and . CSR, volume 8476 of Lecture Notes in Computer Science, page 218-231. Springer, (2014)Poly-logarithmic Frege depth lower bounds via an expander switching lemma., , , and . STOC, page 644-657. ACM, (2016)Combining Ehrenfeucht-Fraïssé Games.. LICS, page 331. IEEE Computer Society, (2009)Existential Positive Types and Preservation under Homomorphisisms.. LICS, page 467-476. IEEE Computer Society, (2005)Homomorphism preservation theorems.. J. ACM, 55 (3): 15:1-15:53 (2008)