We provide general comparative static results for large finite and infinite-dimensional aggregative games. In aggregative games, each player's payoff depends on her own action...
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
The statistical characteristics of network traffic - in particular the observation that it can exhibit long range dependence - have received considerable attention from the resear...
Daniel R. Figueiredo, Benyuan Liu, Vishal Misra, D...
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...