Sciweavers

3179 search results - page 271 / 636
» Applications of PCF Theory
Sort
View
120
Voted
DCC
2006
IEEE
16 years 8 days ago
Uncoverings-by-bases for base-transitive permutation groups
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
Robert F. Bailey
103
Voted
POPL
2010
ACM
15 years 10 months ago
Integrating Typed and Untyped Code in a Scripting Language
Many large software systems originate from untyped scripting language code. While good for initial development, the lack of static type annotations can impact code-quality and per...
Francesco Zappa Nardelli, Jan Vitek, Johan Ös...
90
Voted
SODA
2010
ACM
151views Algorithms» more  SODA 2010»
15 years 10 months ago
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
The linear deterministic model of relay channels is a generalization of the traditional directed network model which has become popular in the study of the flow of information ove...
S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari
91
Voted
CCS
2010
ACM
15 years 7 months ago
Toward practical authorization-dependent user obligation systems
Many authorization system models include some notion of obligation. Little attention has been given to user obligations that depend on and affect authorizations. However, to be u...
Murillo Pontual, Omar Chowdhury, William H. Winsbo...
76
Voted
PLDI
2009
ACM
15 years 7 months ago
Typed self-representation
Self-representation – the ability to represent programs in their own language – has important applications in reflective languages and many other domains of programming langu...
Tillmann Rendel, Klaus Ostermann, Christian Hofer