Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Bridges, Douglas
and
Mahalanobis, Ayan
2001.
Bounded variation implies regulated: a constructive proof.
Journal of Symbolic Logic,
Vol. 66,
Issue. 4,
p.
1695.
Zheng, Xizhong
Rettinger, Robert
and
von Braunmühl, Burchard
2002.
Effectively Absolute Continuity and Effective Jordan Decomposability.
Electronic Notes in Theoretical Computer Science,
Vol. 66,
Issue. 1,
p.
213.
Rettinger, Robert
Zheng, Xizhong
and
von Braunmühl, Burchard
2002.
Computing and Combinatorics.
Vol. 2387,
Issue. ,
p.
47.
Richman, Fred
2002.
Omniscience Principles and Functions of Bounded Variation.
MLQ,
Vol. 48,
Issue. 1,
p.
111.
Zheng, Xizhong
Rettinger, Robert
and
von Braunmühl, Burchard
2003.
STACS 2003.
Vol. 2607,
Issue. ,
p.
167.
Toftdal, Michael
2004.
Automata, Languages and Programming.
Vol. 3142,
Issue. ,
p.
1188.
Bridges, Douglas S.
2020.
Beyond Traditional Probabilistic Data Processing Techniques: Interval, Fuzzy etc. Methods and Their Applications.
Vol. 835,
Issue. ,
p.
9.
NORMANN, DAG
and
SANDERS, SAM
2022.
ON ROBUST THEOREMS DUE TO BOLZANO, WEIERSTRASS, JORDAN, AND CANTOR.
The Journal of Symbolic Logic,
p.
1.
Normann, Dag
and
Sanders, Sam
2022.
Logical Foundations of Computer Science.
Vol. 13137,
Issue. ,
p.
236.
Normann, Dag
and
Sanders, Sam
2022.
On the computational properties of basic mathematical notions.
Journal of Logic and Computation,
Vol. 32,
Issue. 8,
p.
1747.
SANDERS, SAM
2023.
BIG IN REVERSE MATHEMATICS: THE UNCOUNTABILITY OF THE REALS.
The Journal of Symbolic Logic,
p.
1.
Hertling, Peter
2023.
Remarks on the effective Jordan decomposition.
Theoretical Computer Science,
Vol. 940,
Issue. ,
p.
176.