We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
Consider an asynchronous system with private channels and n processes, up to t of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement pr...
Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with onesided error, has been an open problem for years. This note helps to explain why the problem is diffi...
With the advent of open standards and Internet technologies, the number of sellers who can participate in online exchanges is greatly increased. We model the competition between i...
Subhajyoti Bandyopadhyay, John M. Barron, Alok R. ...
Within the TENCompetence project we aim to develop and integrate models and tools into an open source infrastructure for the creation, storage and exchange of learning objects, sui...
Ivana Marenzi, Elena Demidova, Wolfgang Nejdl, Dan...