LEDA and CGAL are platforms for combinatorial and geometric computing. We discuss the use of LEDA and CGAL for geometric computing and show that they provide a unique framework for exact, efficient and convenient geometric computing.

This paper proposes a cake-cutting protocol using cryptography when the cake is a heterogeneous good that is represented by an interval on a real line. Although the Dubins-Spanier moving-knife protocol with one knife achieves simple fairness, all players must execute the protocol synchronously. Thus, the protocol cannot be executed on asynchronous networks such as the Internet. We show that the...

Peer-to-Peer (P2P) data integration combines the P2P infrastructure with traditional scheme-based data integration techniques. Some of the primary problems in this research area are the techniques to be used for querying, indexing and distributing documents among peers in a network especially when document files are in XML format. In order to handle this problem we describe an XML P2P system th...

High throughput is required in many tasks, especially real-time applications. A logical structure of parallel computing system for such applications is a pipeline of multiprocessor modules to be referred to as PMM. In this paper, a linear array based realization of PMM, referred to as PMMLA (PMM based on Linear Array), is proposed. The main design objective is to achieve uncompromised performan...

We analyze a class of proportional cake-cutting algorithms that use a minimal number of cuts (n − 1 if there are n players) to divide a cake that the players value along one dimension. While these algorithms may not produce an envy-free or efficient allocation—as these terms are used in the fair-division literature—one, divide-and-conquer (D&C), minimizes the maximum number of players that any ...