Rudolf H. Fleischer

Publication List Details

Period

2001 - 2004

Number

8

Co-Authors

Just-in-time : better teaching in Hong kong (2004)

Fleischer, Rudolf H.

I report on my experiences with Just-in-Time Teaching (JiTT) in the course COMP272 (Theory of Computing) at the Hong Kong University of Science and Technology. The course was given in spring 2002,...

Maximum residual energy routing with reverse energy cost (2003)

Xie, Qiling, Lea, Chin-Tau, Golin, Mordecai J., Fleischer, Rudolf H.

The Maximum Residual Energy Path (MREP) routing has been shown an effective routing scheme for energy conservation in a battery wireless network. Past studies on MREP are based on the assumption that...

Finding optimal paths in MREP routing (2003)

Fleischer, Rudolf H., Golin, Mordecai J., Lea, Chin-Tau, Wong, Steven

Maximum Residual Energy Path (MREP) routing has been shown an effective routing scheme for energy conservation in battery powered wireless networks. Past studies on MREP routing are based on the...

Solitaire clobber (2002)

Demaine, Erik D., Demaine, Martin L., Fleischer, Rudolf H.

Clobber is a new two-player board game. In this paper, we introduce the one-player variant Solitaire Clobber where the goal is to remove as many stones as possible from the board by alternating white...

Xiangqi and combinatorial game theory (2002)

Fleischer, Rudolf H., Khan, Samee Ullah

We explore whether combinatorial game theory (CGT) is suitable for analyzing endgame positions in Xiangqi (Chinese Chess). We discover some of the game values that can also be found in the analysis...

Fun and frustration – one year teaching at HKUST (2001)

Fleischer, Rudolf H.

I will talk about some of my experiences in my first year teaching computer science at HKUST. I will describe some of the fun I had trying to adapt new teaching concepts to the different student...

Fun-sort (2001)

Biedl, Therese, Chan, Timothy, Demaine, Erik D., Fleischer, Rudolf H., Golin, Mordecai J., Munro, J. Ian

In this paper we study greedy in-place sorting algorithms which miraculously happen to work in reasonable time. Dumb-Sort which repeatedly compares all possible pairs of array cells sorts n elements...