pith. sign in

Theoretical Computer Science , volume =

Taut Monads and · 2002 · DOI 10.1016/s0304-3975(00)00415-1

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
open at publisher browse 2 citing papers

fields

cs.DS 1 math.CT 1

years

2026 2

verdicts

CONDITIONAL 1 UNVERDICTED 1

representative citing papers

A Coalgebraic Dijkstra Algorithm

cs.DS · 2026-05-21 · conditional · novelty 7.0

Introduces coalgebraic shortest path problem as unifying framework and a coalgebraic Dijkstra algorithm that solves it correctly under a necessary and sufficient condition with classical complexity.

Monads in 2-categories

math.CT · 2026-05-04 · unverdicted · novelty 5.0

This paper overviews monads in 2-categories and defines two new double categories of monads extending Lack and Street's 2-categories of monads.

citing papers explorer

Showing 2 of 2 citing papers.

  • A Coalgebraic Dijkstra Algorithm cs.DS · 2026-05-21 · conditional · none · ref 28

    Introduces coalgebraic shortest path problem as unifying framework and a coalgebraic Dijkstra algorithm that solves it correctly under a necessary and sufficient condition with classical complexity.

  • Monads in 2-categories math.CT · 2026-05-04 · unverdicted · none · ref 82

    This paper overviews monads in 2-categories and defines two new double categories of monads extending Lack and Street's 2-categories of monads.