Sciweavers

303 search results - page 8 / 61
» Discrete Mathematics for Computer Science, Some Notes
Sort
View
STACS
1999
Springer
14 years 21 days ago
Upper Bounds for Vertex Cover Further Improved
tended abstract of this work appears in the proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS’99), Springer, LNCS, held in Trier, Fed. Rep. of G...
Rolf Niedermeier, Peter Rossmanith
DGCI
2005
Springer
14 years 2 months ago
Generalized Functionality for Arithmetic Discrete Planes
Naive discrete planes are well known to be functional on a coordinate plane. The aim of our paper is to extend the functionality concept to a larger family of arithmetic discrete ...
Valérie Berthé, Christophe Fiorio, D...

Book
376views
15 years 5 months ago
An Exploration of Random Processes for Engineers
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
Bruce Hajek
BIRTHDAY
2000
Springer
14 years 24 days ago
Discrete time process algebra with silent step
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...
Jos C. M. Baeten, Jan A. Bergstra, Michel A. Renie...
STACS
2010
Springer
14 years 3 months ago
Mathematics, Cryptology, Security
Abstract. In this talk, I will review some of the work performed by the research community in cryptology and security since the invention of public key cryptography by Diffie and H...
Jacques Stern