#### Filter Results:

#### Publication Year

1999

2014

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Somshubhro Bandyopadhyay, P. Oscar Boykin, Vwani P. Roychowdhury, Farrokh Vatan
- Algorithmica
- 2002

We develop a strong connection between maximally commuting bases of orthogonal unitary matrices and mutually unbiased bases. A necessary condition of the existence of mutually unbiased bases for any finite dimension is obtained. Then a constructive proof of the existence of mutually unbiased bases for dimensions that are powers of primes is presented. It is… (More)

- P. Oscar Boykin, Vwani P. Roychowdhury
- Computer
- 2005

Social networks are useful for judging the trustworthiness of outsiders. An automated antispam tool exploits the properties of social networks to distinguish between unsolicited commercial e-mail - spam - and messages associated with people the user knows.

- Nima Sarshar, P. Oscar Boykin, Vwani P. Roychowdhury
- Peer-to-Peer Computing
- 2004

We introduce a scalable searching protocol for locating and retrieving content in random networks with Power-Law (PL) and heavy-tailed degree distributions. The proposed algorithm is capable of finding any content in the network with probability one in time O(log N), with a total traffic that provably scales sub-linearly with the network size, N. Moreover,… (More)

Widespread Internet use has led to the emergence of several kinds of large-scale social networks in cyberspace, most notably e-mail networks. Unfortunately, the tremendous convenience that e-mail affords comes at a high price: Although the network's underlying connectivity is hidden, making it almost impossible to build a comprehensive directory of every… (More)

- Nima Sarshar, P. Oscar Boykin, Vwani P. Roychowdhury
- ArXiv
- 2004

We introduce a scalable searching algorithm for finding nodes and contents in random networks with Power-Law (PL) and heavy-tailed degree distributions. The network is searched using a prob-abilistic broadcast algorithm, where a query message is relayed on each edge with probability just above the bond percolation threshold of the network. We show that if… (More)

- Eli Biham, Michel Boyer, P. Oscar Boykin, Tal Mor, Vwani P. Roychowdhury
- STOC
- 2000

We prove the security of quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computation abilities, and the full power allowed by the rules of classical and quantum physics. A key created that way can then be used to transmit secure messages in a way that their security is… (More)

We characterize the complete set of protocols that may be used to securely encrypt n quantum bits using secret and random classical bits. In addition to the application of such quantum encryption protocols to quantum data security, our framework allows for generalizations of many classical cryptographic protocols to quantum data. We show that the encrypted… (More)

- P. Oscar Boykin, Sam Ritchie, Ian O'Connell, Jimmy Lin
- PVLDB
- 2014

Summingbird is an open-source domain-specific language implemented in Scala and designed to integrate online and batch MapReduce computations in a single framework. Sum-mingbird programs are written using dataflow abstractions such as sources, sinks, and stores, and can run on different execution platforms: Hadoop for batch processing (via… (More)

- P. Oscar Boykin, Meera Sitharam, Pham Huu Tiep, Pawel Wocjan
- Quantum Information & Computation
- 2007

- Jesse S. A. Bridgewater, P. Oscar Boykin, Vwani P. Roychowdhury
- IEEE Transactions on Parallel and Distributed…
- 2007

We present a novel framework, called balanced overlay networks (BON), that provides scalable, decentralized load balancing for distributed computing using large-scale pools of heterogeneous computers. Fundamentally, BON encodes the information about each node's available computational resources in the structure of the links connecting the nodes in the… (More)