• Publications
  • Influence
Exploring the role of visualization and engagement in computer science education
Visualization technology can be used to graphically illustrate various concepts in computer science. We argue that such technology, no matter how well it is designed, is of little educational valueExpand
  • 502
  • 48
  • PDF
Online Scheduling Revisited
TLDR
We present a newon line algorithm, MR, for nonpreemptive scheduling of jobs with known processing times on m identical machines which beats the best previous algorithm for m ≥ 64. Expand
  • 90
  • 14
  • PDF
Evaluating the educational impact of visualization
TLDR
The educational impact of visualization depends not only on how well students learn when they use it, but also on how widely it is used by instructors. Expand
  • 170
  • 13
  • PDF
On‐line scheduling revisited
TLDR
We present a new on-line algorithm, MR, for non-preemptive scheduling of jobs with known processing times on m identical machines which beats the best previous algorithm for m⩾64. Expand
  • 125
  • 11
Exploring the role of visualization and engagement in computer science education
TLDR
We propose a new taxonomy of learner engagement with visualization technology and a framework for experimental studies of visualization effectiveness. Expand
  • 208
  • 10
Order Preserving Matching
TLDR
We introduce a new string matching problem called order-preserving matching on numeric strings, where a pattern matches a text if the text contains a substring of values whose relative orders coincide with those of the pattern. Expand
  • 66
  • 10
  • PDF
A Simple Balanced Search Tree with O(1) Worst-Case Update Time
  • Rudolf Fleischer
  • Mathematics, Computer Science
  • Int. J. Found. Comput. Sci.
  • 1 June 1996
TLDR
In this paper we show how a slight modification of (a, 2b)-trees allows us to perform member and neighbor queries in O(log n) time and updates inO(1) worst-case time (once the position of the inserted or deleted key is known). Expand
  • 44
  • 7
  • PDF
On The Bahncard Problem
TLDR
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. Expand
  • 53
  • 6
Tight Bounds on Maximal and Maximum Matchings
TLDR
We study bounds on maximal and maximum matchings in special graph classes, specifically triangulated graphs and graphs with bounded maximum degree. Expand
  • 45
  • 6
  • PDF
Exploring an Unknown Graph Efficiently
TLDR
We present the first deterministic online exploration algorithm whose competitive ratio is polynomial in d (it is O(d8)). Expand
  • 77
  • 5
  • PDF