332 search results - page 7 / 67 » An Aristotelian notion of size |
65
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
CSFW
2007
IEEE
15 years 4 months ago
2007
IEEE
Collaboration among organizations or individuals is common. While these participants are often unwilling to share all their information with each other, some information sharing i...
CSL
2002
Springer
14 years 9 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
SCN
2010
Springer
14 years 8 months ago
2010
Springer
Aggregate message authentication codes, as introduced by Katz and Lindell (CT-RSA 2008), combine several MACs into a single value, which has roughly the same size as an ordinary MA...