Association for Computing Machinery
About: Sigact News is an academic journal published by Association for Computing Machinery. The journal publishes majorly in the area(s): Column (database) & Computational geometry. Over the lifetime, 1056 publications have been published receiving 27842 citations.
Topics: Column (database), Computational geometry, Distributed algorithm, Mathematical proof, Quantum computer
Papers published on a yearly basis
TL;DR: This column presents an intuitive overview of linear logic, some recent theoretical results, and summarizes several applications oflinear logic to computer science.
Abstract: Linear logic was introduced by Girard in 1987  . Since then many results have supported Girard' s statement, \"Linear logic is a resource conscious logic,\" and related slogans . Increasingly, computer scientists have come to recognize linear logic as an expressive and powerful logic with connection s to a variety of topics in computer science . This column presents a.n intuitive overview of linear logic, some recent theoretical results, an d summarizes several applications of linear logic to computer science . Other introductions to linear logic may be found in [12, 361 .
TL;DR: In this paper, it is shown that it is impossible to achieve consistency, availability, and partition tolerance in the asynchronous network model, and then solutions to this dilemma in the partially synchronous model are discussed.
Abstract: When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all three. In this note, we prove this conjecture in the asynchronous network model, and then discuss solutions to this dilemma in the partially synchronous model.
TL;DR: It is shown that in compensation for this "quantum noise", quantum mechanics allows us novel forms of coding without analogue in communication channels adequately described by classical physics.
Abstract: restrictions on measurement related to the uncertainty principal. Two concrete examples and some general results are given. The uncertainty principle imposes restrictions on the capacity of certain types of communication channels. This paper will show that in compensation for this \"quantum noise\", quantum mechanics allows us novel forms of coding without analogue in communication channels adequately described by classical physics.
TL;DR: Back in 1969, two other guys and I squeezed into a Volkswagen Beetle and headed north to the northernmost tip of Norway, where the authors could watch the midnight sun not set over the ocean, and it was a trip worth remembering for many reasons.
Abstract: Back in 1969—which, come to think of it, seems like a long time ago even to me—I was thoroughly enjoying my junior year abroad at the University of Bonn in what was then West Germany. After the spring semester was over, two other guys and I squeezed into a Volkswagen Beetle and headed north. Earlier, between the fall and spring semesters, we had made a trip through Southern Europe, the world like the three lost American greenhorns we were. The cultural experiences were varied and captivating, and they whetted our appetites for more. So now it was time to take a look at Northern Europe. Our destination was the northernmost tip of Norway (Nordkap was it?), where we could watch the midnight sun not set over the ocean. We made it. It was a trip worth remembering for many reasons. For one thing, we stayed in a youth hostel near our destination. Most youth hostels at that time had a curfew of 10:00 or 11:00 in the evening, an issue that had the potential of throwing a monkey wrench into our well-laid plans to watch the midnight sun. We checked with the hosts of the hostel, who were at the time sitting around their dining room table after their evening meal carrying on pleasant conversation. \" Would it be alright if we went to watch the midnight sun? \" we wondered. \" Of course, of course! \" \" Well, how would we get back into the hostel on our return? \" \" Oh, don't worry. We'll still be up. \" \" Really? At two in the morning? Man, when do you all sleep? \" After the slightly wearied pause of one who has had to answer this question innumerable times: \" In the winter. \" Indeed, when we got back from our excursion, people of all ages were walking the streets of the small town as if it were two in the afternoon rather than two in the morning. And back at the hostel our host family was still seated pretty much in their same positions around the same table, still talking in the same language. That was one more new fascinating cultural experience to tuck away. But there was another memorable part to the venture that evening that involved only us three Americans. The weather was perfect. We were at the tail end of the season of the midnight …
TL;DR: For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. as discussed by the authors introduces the basic concepts in the design and analysis of randomized algorithms and provides a comprehensive and representative selection of the algorithms that might be used in each of these areas.
Abstract: For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algorithmic examples are also given to illustrate the use of each tool in a concrete setting. In the second part of the book, each chapter focuses on an important area to which randomized algorithms can be applied, providing a comprehensive and representative selection of the algorithms that might be used in each of these areas. Although written primarily as a text for advanced undergraduates and graduate students, this book should also prove invaluable as a reference for professionals and researchers.