It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...
Scientific workflows are increasingly used for rapid integration of existing algorithms to form larger and more comgrams. Such workflows promise to provide more abstract, yet execu...
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...