Sciweavers

1089 search results - page 209 / 218
» Bounds on generalized Frobenius numbers
Sort
View
ESOP
2001
Springer
14 years 1 days ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
EUROCRYPT
2001
Springer
14 years 1 days ago
Priced Oblivious Transfer: How to Sell Digital Goods
Abstract. We consider the question of protecting the privacy of customers buying digital goods. More specifically, our goal is to allow a buyer to purchase digital goods from a ve...
William Aiello, Yuval Ishai, Omer Reingold
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
13 years 12 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
13 years 11 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...
ICPADS
1994
IEEE
13 years 11 months ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...