pith. sign in

Finding the Cyclic Covers of a String

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

2 Pith papers citing it

citation-role summary

background 1

citation-polarity summary

fields

cs.CE 1 cs.DS 1

years

2026 1 2022 1

roles

background 1

polarities

background 1

clear filters

representative citing papers

GROSS: German Rail Open-Source SUMO Scenario

cs.CE · 2026-06-02 · conditional · novelty 6.0

GROSS is an open pipeline generating nation-scale German rail scenarios for SUMO via topology-aware stop mapping from OSM and GTFS, reducing teleportations 1.7-76.8x versus prior methods.

String Covering: A Survey

cs.DS · 2022-11-21 · unverdicted · novelty 0.0

A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • GROSS: German Rail Open-Source SUMO Scenario cs.CE · 2026-06-02 · conditional · none · ref 5

    GROSS is an open pipeline generating nation-scale German rail scenarios for SUMO via topology-aware stop mapping from OSM and GTFS, reducing teleportations 1.7-76.8x versus prior methods.