Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Abstract. People rapidly learn the capabilities of a new location, without observing every service and product. Instead they map a few observations to familiar clusters of capabili...
Abstract. Mobile phones are increasingly becoming ubiquitous computational devices that are almost always available, individually adaptable, and nearly universally connectable (usi...
Christof Roduner, Marc Langheinrich, Christian Flo...
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
Alberto Bertoni, Massimiliano Goldwurm, Violetta L...