@inbook {Kor-CTAT-2007,
	title = {Combining {CAS} and {DGS} {\textendash} {T}owards {A}lgorithmic {T}hinking},
	booktitle = {Symbolic Computation and Education},
	year = {2007},
	pages = {150-173},
	publisher = {World Scientific},
	organization = {World Scientific},
	address = {Singapore},
	abstract = {This article discusses some ways to combine software for interactive geometry and computer algebra, with an emphasis on using this software in teaching. Some arising mathematical problems and necessary software specific paradigms that have to be adjusted are considered, and solutions to these problems are presented. The article also highlights some of the aspects that drove the development of the mathematics software Cinderella.2, which integrates an interactive geometry software package, a physics simulation engine, and an all-purpose functional programming language.},
	keywords = {refereed},
	author = {Kortenkamp, Ulrich},
	editor = {Li, Shangzhi and Wang, Dongming and Zhang, Jing-Zhong}
}
@conference {KorRic-DCDG-2001,
	title = {Decision complexity in {D}ynamic {G}eometry},
	booktitle = {Proceedings of ADG 2000},
	series = {Lecture Notes in Artificial Intelligence},
	number = {2061},
	year = {2001},
	pages = {167{\textendash}172},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {Heidelberg},
	abstract = {<p>
	Geometric straight-line programs [5,8] can be used to model geometric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding whether two instances of the same geometric straight-line program are connected by a continuous path, the Complex Reachability Problem.</p>
},
	keywords = {refereed},
	url = {http://kortenkamps.net/papers/2001/36_DecisionComplexity.pdf},
	author = {Kortenkamp, Ulrich and Richter-Gebert, J{\"u}rgen},
	editor = {Wang, Dongming}
}
@conference {KorRic-DCDG-2000,
	title = {Decision complexity in {D}ynamic {G}eometry},
	booktitle = {Proceedings of ADG 2000},
	series = {International Workshop on Automatic Deduction in Geometry},
	volume = {3},
	year = {2000},
	note = {Extended Abstract},
	pages = {216{\textendash}220},
	abstract = {<p>
	Geometric straight-line programs [6, 10] can be used to model geo- metric constructions and their implicit ambiguities. In this paper we discuss the complexity of deciding whether two instances of the same geometric straight-line program are connected by a continuous path, the Complex Reachability Problem.</p>
},
	keywords = {refereed},
	url = {http://kortenkamps.net/papers/2000/ADG2000_UK.pdf},
	author = {Kortenkamp, Ulrich and Richter-Gebert, J{\"u}rgen},
	editor = {Wang, Dongming}
}
