CHI '86 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
The alphaslider: a compact and rapid selector
CHI '94 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Pad++: a zooming graphical interface for exploring alternate interface physics
UIST '94 Proceedings of the 7th annual ACM symposium on User interface software and technology
Proceedings of the ACM SIGCHI Conference on Human factors in computing systems
Popup vernier: a tool for sub-pixel-pitch dragging with smooth mode transition
Proceedings of the 11th annual ACM symposium on User interface software and technology
Selection from alphabetic and numeric menu trees using a touch screen: breadth, depth, and width
CHI '85 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
UIST '00 Proceedings of the 13th annual ACM symposium on User interface software and technology
Personal and Ubiquitous Computing
Searching large indexes on tiny devices: optimizing binary search with character pinning
Proceedings of the 14th international conference on Intelligent user interfaces
Supporting blind users in selecting from very long lists of items on mobile phones
Proceedings of the 12th international conference on Human computer interaction with mobile devices and services
Hi-index | 0.00 |
Searching for an item in a long ordered list is a frequent task when using any kind of computing device (from desktop PCs to mobile phones). This paper explores three different interfaces to support this task on the limited screen of mobile devices (e.g., PDAs, in-car systems, mobile phones). Two of the considered interfaces are based on the idea of tree-augmentation of a list proposed in Furnas’ Effective View Navigation theory [6] and differ in their depth versus breadth ratio. The third interface adopts the traditional technique of list scrolling based on keyboard entry. We compare them in terms of search time, number of errors, and user’s satisfaction. Results show that list scrolling based on keyboard entry outperforms both tree-augmented lists and that the broader tree-augmented list is better than the deeper one.