1452 search results - page 99 / 291 » Algorithmic Analysis of Array-Accessing Programs |
101
click to vote
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
100
click to vote
ESA
2006
Springer
15 years 4 months ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
92
Voted
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
CORR
2007
Springer
15 years 12 days ago
2007
Springer
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
110
Voted
RTAS
2008
IEEE
15 years 6 months ago
2008
IEEE
Recent technologies such as the Real-Time Specification for Java promise to bring Java’s advantages to real-time systems. While these technologies have made Java more predictab...