1,226,222 Hits in 5.8 sec

Teaching the Foundations of Computational Science on the Undergraduate Level [chapter]

C. Freundl, H. Köstler, U. Rüde
2006 Lecture Notes in Computer Science  
This paper describes a new course introduced at University of Erlangen-Nürnberg to teach the foundations of computational science for undergraduates at the end of their second year.  ...  The course is a mandatory part of the curriculum in three different computer sciencerelated degree programs.  ...  Meyer for giving feedback on the supervised teaching.  ... 
doi:10.1007/11758525_25 fatcat:ts255hnqe5dkjir5qzq26tuhpq

Special Issue on the Foundations of Software Science and Computation Structures

Juan A. Lara, Shadi Aljawarneh
2019 Foundations of Science  
the era of the Software and Computing fields.  ...  In this full review paper, the recent emerging trends in Computing Structures, Software Science, and System Applications have been reviewed and explored to address the recent topics and contributions in  ...  Finally, we would like to thank Professor Diederik Aerts, Editor-in-Chief, and editorial assistants of Foundations of Science for their support during the preparation of this issue.  ... 
doi:10.1007/s10699-019-09587-7 fatcat:twjadaw5gvh3vkkltcydm7326e

On the Establishment of Computational Information Science Foundation for Human, Artifact Systems and Services supporting Society5.0

2019 The Proceedings of Mechanical Engineering Congress Japan  
doi:10.1299/jsmemecj.2019.f01101 fatcat:tjm2kq2gr5g4zbassyoxkqzyga

On the foundations of modern cryptography [chapter]

Oded Goldreich
1997 Lecture Notes in Computer Science  
Furthermore, plain RSA (alike any deterministic public-key encryption scheme) is not secure (as one can easily distinguish the encryption of one predetermined message from the encryption of another).  ...  In our opinion, the Foundations of Cryptography are the paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems.  ...  -FOeS is IEEE Symposium on Foundations of Computer Science.  ... 
doi:10.1007/bfb0052227 fatcat:g5eprxwuwncivbinj4qkonpvbe

On the foundations of oblivious transfer [chapter]

Christian Cachin
1998 Lecture Notes in Computer Science  
We show that oblivious transfer can be based on a very general notion of asymmetric information di erence.  ...  We show that oblivious transfer can be reduced to a single execution of UOT(X; Y ) with Bob's knowledge Y restricted in terms of R enyi entropy of order > 1.  ...  Introduction Oblivious transfer is a cornerstone in the foundations of cryptography.  ... 
doi:10.1007/bfb0054139 fatcat:nydszujs5jcepgcon64zbjjire

On the Validation of Computer Science Theories [chapter]

B. J. MacLennan
1985 Empirical Foundations of Information and Software Science  
On The Validation of Computer Science Theories We address normatively the demarcation problem for Computer Science: How can Computer Science research be conducted scientifically?  ...  How. ever, if we wish to use computer science as a foundation for software engineering, then this standard will not do.  ... 
doi:10.1007/978-1-4613-2521-5_26 fatcat:bgffypqye5et5f7ru7mg4krige

Preface to the Special Issue on Philosophy in Computer Science

Sławomir Leciejewski
2019 Foundations of Computing and Decision Sciences  
Fleck's concept of thought style allows to realize the fact that in contemporary empirical sciences we deal with a computer thought style, as most research works are currently conducted with the use of  ...  In this article I support the thesis that contemporary research works are dominated by the computer research style. I refer to the findings of Fleck, Bolter, Castells, Crombie and Hacking.  ...  Preface to the Special Issue on Philosophy in Computer Science Acknowledgement This article is a translation of chapter 4.3 of [12] which was originally published in Polish.  ... 
doi:10.2478/fcds-2019-0001 fatcat:aq3s7zzazfddrboxgoppjgwbwq

On the Foundations of Quantitative Information Flow [chapter]

Geoffrey Smith
2009 Lecture Notes in Computer Science  
We then explore an alternative foundation based on a concept of vulnerability (closely related to Bayes risk) and which measures uncertainty using Rényi's min-entropy, rather than Shannon entropy.  ...  The emerging consensus is that quantitative information flow should be founded on the concepts of Shannon entropy and mutual information.  ...  This work was partially supported by the National Science Foundation under grants HRD-0317692 and CNS-0831114.  ... 
doi:10.1007/978-3-642-00596-1_21 fatcat:oh7ptzqltzfptbv226bvsshln4

On the Logical Foundations of Moral Agency [chapter]

Emiliano Lorini
2012 Lecture Notes in Computer Science  
Although this concept has been extensively studied in social philosophy and in social sciences, it has been far less studied in the field of deontic logic and multi-agent systems (MASs).  ...  The aim of this work is to provide a logical analysis of moral agency.  ...  Acknowledgements This research has been supported by the French ANR project EmoTES "Emotions in strategic interaction: theory, experiments, logical and computational studies", contract No. 11-EMCO-004-  ... 
doi:10.1007/978-3-642-31570-1_8 fatcat:gcthd3nljbdsvpr32ryuj5lznm

On the Foundations of Universal Sequence Prediction [chapter]

Marcus Hutter
2006 Lecture Notes in Computer Science  
It even performs well (actually better) in non-computable environments.  ...  Solomonoff completed the Bayesian framework by providing a rigorous, unique, formal, and universal choice for the model class and the prior.  ...  Machine learning, the computer science branch of statistics, often deals with very large model classes.  ... 
doi:10.1007/11750321_39 fatcat:2u7ervgkjnhb3mrmfsbbsqmcuy

On the Computational Complexity of Coin Flipping

Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai
2010 2010 IEEE 51st Annual Symposium on Foundations of Computer Science  
party implies the existence of (infinitely often) one-way functions.  ...  Coin flipping is one of the most fundamental tasks in cryptographic protocol design.  ...  We are grateful to Russell Impagliazzo for proposing this intriguing area of investigation, and a number of useful conversations.  ... 
doi:10.1109/focs.2010.64 dblp:conf/focs/MajiPS10 fatcat:lbxg5nflfjcslp2oxai45rzfiu

The complexity of parallel computation on matroids

Richard M. Karp, Eli Upfal, Avi Wigderson
1985 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)  
In [KUW1] we have proposed the setting of independence systems to study the relation between the computational complexity of search and decision problems.  ...  This is one of the first nontrivial, super-logarithmic lower bounds on a randomized parallel computation. It implies that in our model of computation Random-NC is strictly contained in $P$.  ...  From the upper bounds on parallel time above we decide similar bounds (up to a polylog factor) on the sequential space required by a deterministic Turing machine with an independence oracle to solve the  ... 
doi:10.1109/sfcs.1985.57 dblp:conf/focs/KarpUW85 fatcat:7tzvzckzxjeanmkce3zwfpdcny

Lower bounds on the depth of monotone arithmetic computations

D. Coppersmith, B. Schieber
1992 Proceedings., 33rd Annual Symposium on Foundations of Computer Science  
ACKNOWLEDGMENTS We thank Alok Aggarwal for introducing us to the problem and for many fruitful discussions. We are also grateful to Uri Feige and Allan Borodin for their help.  ...  INTRODUCTION The problem of restructuring an arithmetic expression into an equivalent one of reduced depth is one of the basic problems in parallel computation [BKM73, B74, BM75, KM75, MP76, SS80, JS82  ...  Kosaraju [Kos86] gave a tight bound of log n+-log n+ o(-log n) on the depth of computation trees for such arithmetic expressions.  ... 
doi:10.1109/sfcs.1992.267763 dblp:conf/focs/CoppersmithS92 fatcat:kk4h5xi72vftnl6mnwlgxh3upm

On the Hardness of Signaling

Shaddin Dughmi
2014 2014 IEEE 55th Annual Symposium on Foundations of Computer Science  
We focus on one of the simplest instantiations of the signaling question: Bayesian zero-sum games, and a principal who must choose an information structure maximizing the equilibrium payoff of one of the  ...  computation.  ...  We also thank the anonymous FOCS reviewers for helpful feedback and suggestions.  ... 
doi:10.1109/focs.2014.45 dblp:conf/focs/Dughmi14 fatcat:wdd3tmsxqbgxpj4o7wyfgybjjm


1991 International Journal of Foundations of Computer Science  
One is $PF^{NP}$ , the class of functions computable in polynomial-time with polynomial number of queries to NP oracle sets.  ...  In this paper, we will observe that $PF_{\iota\iota}^{NP}$ , the class of functions computable in polynomial-time with one free evaluation of unbounded parallel queries to NP oracle sets, captures that  ...  An upper bound of computing optimal solutions In this section, we first show an upper bound on the complexity of computing optimal solutions.  ... 
doi:10.1142/s0129054191000133 fatcat:exbfirow7rfvvktkecrpd4hs4a
« Previous Showing results 1 — 15 out of 1,226,222 results