Sciweavers

1168 search results - page 61 / 234
» cases 2000
Sort
View
COMBINATORICS
2000
128views more  COMBINATORICS 2000»
13 years 9 months ago
Continued Fractions and Catalan Problems
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...
Mahendra Jani, Robert G. Rieper
DGCI
2000
Springer
14 years 2 months ago
A New Means for Investigating 3-Manifolds
The paper presents a new method of investigating topological properties of three-dimensional manifolds by means of computers. Manifolds are represented as finite cell complexes. Th...
Vladimir Kovalevsky
EUROCRYPT
2000
Springer
14 years 1 months ago
Construction of Nonlinear Boolean Functions with Important Cryptographic Properties
Abstract. This paper addresses the problem of obtaining new construction methods for cryptographically significant Boolean functions. We show that for each positive integer m, ther...
Palash Sarkar, Subhamoy Maitra
SODA
2000
ACM
120views Algorithms» more  SODA 2000»
13 years 11 months ago
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
S. Thomas McCormick, Akiyoshi Shioura
SIGECOM
2000
ACM
142views ECommerce» more  SIGECOM 2000»
14 years 2 months ago
Bidding clubs: institutionalized collusion in auctions
We introduce a class of mechanisms, called bidding clubs, for agents to coordinate their bidding in auctions. In a bidding club agents first conduct a “pre-auction” within th...
Kevin Leyton-Brown, Yoav Shoham, Moshe Tennenholtz