Sciweavers

656 search results - page 24 / 132
» Graph Theoretical Characterization and Computation of Answer...
Sort
View
TIT
2008
84views more  TIT 2008»
14 years 11 months ago
Information Theoretic Bounds on Authentication Systems in Query Model
Authentication codes provide message integrity guarantees in an information theoretic sense within a symmetric key setting. Information theoretic bounds on the success probability...
Reihaneh Safavi-Naini, Peter R. Wild
RTA
2010
Springer
15 years 1 months ago
Underspecified computation of normal forms
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
Alexander Koller, Stefan Thater
FOCS
2009
IEEE
15 years 6 months ago
Regularity Lemmas and Combinatorial Algorithms
— We present new combinatorial algorithms for Boolean matrix multiplication (BMM) and preprocessing a graph to answer independent set queries. We give the first asymptotic impro...
Nikhil Bansal, Ryan Williams
FOCS
2009
IEEE
15 years 6 months ago
Convergence to Equilibrium in Local Interaction Games
— We study a simple game theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which ...
Andrea Montanari, Amin Saberi
IEEESCC
2009
IEEE
14 years 9 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...