Bull. EATCS最新文献_第2页

K-Best Enumeration K-Best枚举

Bull. EATCS Pub Date : 2014-12-16 DOI: 10.1007/978-1-4939-2864-4_733

D. Eppstein

引用次数: 35

Contextual Semantics: From Quantum Mechanics to Logic, Databases, Constraints, and Complexity 上下文语义:从量子力学到逻辑、数据库、约束和复杂性

Bull. EATCS Pub Date : 2014-06-20 DOI: 10.1142/9789814730617_0002

S. Abramsky

引用次数: 59

When is A=B? 什么时候A=B?

Bull. EATCS Pub Date : 2013-10-04 DOI: 10.1201/9781482292244-13

Anja Gruünheid, Donald Kossmann, Besmira Nushi

引用次数: 22

Secure Computation Under Network and Physical Attacks 网络和物理攻击下的安全计算

Bull. EATCS Pub Date : 2013-04-22 DOI: 10.14273/UNISA-84

Alessandra Scafuro

引用次数: 0

Algorithmics of Matching Under Preferences 偏好下的匹配算法

Bull. EATCS Pub Date : 2013-03-20 DOI: 10.1142/8591

D. Manlove

{"title":"Algorithmics of Matching Under Preferences","authors":"D. Manlove","doi":"10.1142/8591","DOIUrl":"https://doi.org/10.1142/8591","url":null,"abstract":"A new book by Dr David Manlove of the School of Computing Science has recently been published by World Scientific as part of their Series on Theoretical Computer Science. This book, called “Algorithmics of Matching Under Preferences”, deals with algorithms and complexity issues surrounding the matching of agents to one another when preferences are involved. \u0000 \u0000For example, in several countries, centralised matching schemes handle the annual allocation of intending junior doctors to hospitals based on their preferences over one another. Efficient algorithms required to solve the underlying theoretical matching problems. Similar examples arise in the allocation of pupils to schools, students to projects, kidney patients to donors, and so on. \u0000 \u0000The book surveys algorithmic results for a range of matching problems involving preferences, with practical applications areas including those mentioned above. It covers the classical Stable Marriage, Hospitals/Residents and Stable Roommates problems, where so-called stable matchings are sought, thereby providing an update to “The Stable Marriage problem, Structure and Algorithms”, by Dan Gusfield and Rob Irving, published by MIT Press in 1989. It also extends the coverage to the House Allocation problem, where stability is no longer the key requirement for a matching, and other definitions of optimality hold. \u0000 \u0000This book builds on the author’s prior research in this area, and also his practical experience of developing, with colleagues including Rob Irving and Gregg O’Malley, algorithms for matching kidney patients to donors in the UK (collaborating with NHS Blood and Transplant), for assigning medical students to hospitals in Scotland (in collaboration with NHS Education for Scotland), and for allocating students to elective courses and projects (within the Schools of Medicine and Computing Science at the University of Glasgow, respectively). \u0000 \u0000The book is also timely, as the research area recently came to the forefront in 2012 following the award of the Nobel Prize in Economic Sciences to Alvin Roth and Lloyd Shapley, two leading contributors to the field of matching theory and its application in practical settings, whose work is described in detail throughout the book. \u0000 \u0000A Foreword is contributed by Kurt Mehlhorn of Max-Planck Institut fur Informatik, Saarbrucken, who wrote: “This book covers the research area in its full breadth and beauty. Written by one of the foremost experts in the area, it is a timely update to “The Stable Marriage Problem: Structure and Algorithms” (D. Gusﬁeld and R.W. Irving, 1989). This book will be required reading for anybody working on the subject; it has a good chance of becoming a classic.”","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128957734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 488

Mihai Pǎtraşcu: obituary and open problems 米海Pǎtraşcu:讣告和公开问题

Bull. EATCS Pub Date : 2013-03-06 DOI: 10.1145/2447712.2447737

M. Thorup

{"title":"Mihai Pǎtraşcu: obituary and open problems","authors":"M. Thorup","doi":"10.1145/2447712.2447737","DOIUrl":"https://doi.org/10.1145/2447712.2447737","url":null,"abstract":"Mihai Pǎtraşcu, aged 29, passed away on Tuesday June 5, 2012, after a 1.5 year battle with brain cancer. Mihai’s academic career was short but explosive, full of rich and beautiful ideas as witnessed, e.g., in his 20 STOC/FOCS papers. His many interesting papers are available online at: http://people.csail.mit.edu/mip/papers/index.html. Mihai’s talent showed early. In high school he received numerous medals at national (Romanian) and international olympiads including prizes in informatics, physics and applied math. He received gold medals at the International Olympiad in Informatics (IOI) in both 2000 and 2001. He remained involved with olympiads and was elected member of the International Scientific Committee for the International Olympiad of Informatics since 2010. Mihai’s main research area was data structure lower bounds. In data structures we try to understand how we can efficiently represent, access, and update information. Mihai revolutionized and revitalized the lower bound side, in many cases matching known upper bounds. The lower bounds were proved in the powerful cell-probe model that only charges for memory access, hence which captures both RAM and external memory. Already in 2004 [17], as a second year undergraduate student, with his supervisor Erik Demaine as non-alphabetic second author, he broke the Ω(log n/ log log n) lower bound barrier that had impeded dynamic lower bounds since 1989 [6], and showed the first logarithmic lower bound by an elegant short proof, a true combinatorial gem. The important conclusion was that binary search trees are optimal algorithms for the textbook problem of maintaining prefix sums in a dynamic array. They also proved an Ω(log n) lower bound for dynamic trees, matching Sleator and Tarjan’s upper bound from 1983 [20]. In 2005 he received from the Computing Research Association (CRA) the Outstanding Undergraduate Award for best undergraduate research in the US and Canada. I was myself lucky enough to meet Mihai in 2004, starting one of most intense collaborations I have experienced in my career. It took us almost two years to find the first separation between near-linear and polynomial space in data structures [19]. What kept us going on this hard problem was that we always had lots of fun on the side: playing squash, going on long hikes, and having beers celebrating every potentially useful idea we found on the way. A strong friendship was formed. Mihai published more than 10 papers while pursuing his undergraduate studies at MIT from 2002 to 2006. Nevertheless he finished with a perfect 5.0/5.0 GPA. Over the next 2 years, he did his PhD at MIT. His thesis “Lower Bound Techniques for Data Structures” [11] is a must-read for researchers who want to get into data structure lower bounds. During Mihai’s PhD, I got to be his mentor at AT&T, and in 2009, after a year as Raviv Postdoctoral Fellow at IBM Almaden, he joined me at AT&T. We continued our work on lower bounds, but I also managed to get him inte","PeriodicalId":388781,"journal":{"name":"Bull. EATCS","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125047978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Boolean Function Complexity Advances and Frontiers 布尔函数复杂性的进展与前沿

Bull. EATCS Pub Date : 2012-01-06 DOI: 10.1007/978-3-642-24508-4

S. Jukna

引用次数: 415

Anatomy and Empirical Evaluation of Modern SAT Solvers 现代SAT解算器的解剖与实证评价

Bull. EATCS Pub Date : 2011-12-02 DOI: 10.14288/1.0043924

K. Sakallah, Joao Marques-Silva

引用次数: 20

Development of a Bacteria Computer: From in silico Finite Automata to in virto AND in vivo 细菌计算机的发展:从硅有限自动机到虚拟与体内

Bull. EATCS Pub Date : 2010-06-30 DOI: 10.1007/978-3-642-13962-8_40

Y. Sakakibara