Sciweavers

1132 search results - page 159 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
IACR
2011
149views more  IACR 2011»
14 years 6 months ago
Improved zero-sum distinguisher for full round Keccak-f permutation
Keccak is one of the five hash functions selected for the final round of the SHA-3 competition and its inner primitive is a permutation called Keccakf. In this paper, we find t...
Ming Duan, Xuejia Lai
MFCS
2009
Springer
16 years 28 days ago
Branching Programs for Tree Evaluation
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
ECCC
2010
80views more  ECCC 2010»
15 years 6 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
MOBIHOC
2008
ACM
16 years 6 months ago
The capacity and energy efficiency of wireless ad hoc networks with multi-packet reception
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
Zheng Wang, Hamid R. Sadjadpour, Jose Joaquin Garc...
ICALP
2009
Springer
16 years 6 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams