We develop and analyze least-squares finite element methods for two complementary div-curl elliptic boundary value problems. The first one prescribes the tangential component of ...
Pavel B. Bochev, Kara Peterson, Christopher M. Sie...
APlace is a high quality, scalable analytical placer. This paper describes our recent efforts to improve APlace for speed and scalability. We explore various wirelength and densi...
Abstract. We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the f...
Antonio E. Porreca, Giancarlo Mauri, Claudio Zandr...
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
Abstract—The excellent bit error rate performance of new iterative decoding algorithms (e.g., turbodecoding) is achieved at the expense of a computationally burdensome decoding p...