Podcasts about theoretical computer science

Computer technology is evolving at a rapid pace, but have you ever wondered how computer scientists are able to make the devices we use on a every day basis so fast? How do machine learning computers and artificial intelligence work at such a high capacity? The work of theoretical computer scientists, that use math instead of programming to provide a rigorous framework for understanding what computation is, how it can be performed, and what its limitations are. In a first for Science Like Me, two guests... postdoctoral research scientist Yinzhan Xu and Ph.D. student Chris Ye discuss their theoretical computer science work with EnCORE, the Institute for Emerging CORE Methods in Data Science and how by applying math to find different ways of solving problems and making computations more efficient. Series: "Science Like Me" [Science] [Show ID: 40378]

Computer technology is evolving at a rapid pace, but have you ever wondered how computer scientists are able to make the devices we use on a every day basis so fast? How do machine learning computers and artificial intelligence work at such a high capacity? The work of theoretical computer scientists, that use math instead of programming to provide a rigorous framework for understanding what computation is, how it can be performed, and what its limitations are. In a first for Science Like Me, two guests... postdoctoral research scientist Yinzhan Xu and Ph.D. student Chris Ye discuss their theoretical computer science work with EnCORE, the Institute for Emerging CORE Methods in Data Science and how by applying math to find different ways of solving problems and making computations more efficient. Series: "Science Like Me" [Science] [Show ID: 40378]

Computer technology is evolving at a rapid pace, but have you ever wondered how computer scientists are able to make the devices we use on a every day basis so fast? How do machine learning computers and artificial intelligence work at such a high capacity? The work of theoretical computer scientists, that use math instead of programming to provide a rigorous framework for understanding what computation is, how it can be performed, and what its limitations are. In a first for Science Like Me, two guests... postdoctoral research scientist Yinzhan Xu and Ph.D. student Chris Ye discuss their theoretical computer science work with EnCORE, the Institute for Emerging CORE Methods in Data Science and how by applying math to find different ways of solving problems and making computations more efficient. Series: "Science Like Me" [Science] [Show ID: 40378]

Computer technology is evolving at a rapid pace, but have you ever wondered how computer scientists are able to make the devices we use on a every day basis so fast? How do machine learning computers and artificial intelligence work at such a high capacity? The work of theoretical computer scientists, that use math instead of programming to provide a rigorous framework for understanding what computation is, how it can be performed, and what its limitations are. In a first for Science Like Me, two guests... postdoctoral research scientist Yinzhan Xu and Ph.D. student Chris Ye discuss their theoretical computer science work with EnCORE, the Institute for Emerging CORE Methods in Data Science and how by applying math to find different ways of solving problems and making computations more efficient. Series: "Science Like Me" [Science] [Show ID: 40378]

We are pleased to invite you to a LIVE distinguished YouTube panel discussion on Strategies for Securing Early Career Awards

Artur Pessoa is an Associate Professor at Universidade Federal Fluminense, Brazil. He holds a bachelor's degree in Computer Engineering from PUC-Rio and master's and doctoral degrees in Informatics from the same institution. His research interests focus on developing insightful approaches to solving optimization problems in general. Artur has contributed to designing solution methods based on integer programming, column generation, dynamic programming, branch-and-bound, and related techniques to tackle combinatorial, bilevel, robust, and other optimization problems. He is one of the key figures behind several state-of-the-art exact algorithms for vehicle routing, scheduling, and generalized quadratic assignment problems. He has published papers in prestigious journals like Mathematical Programming, Operations Research, Theoretical Computer Science, SIAM Journal on Computing, Mathematical Programming Computation, INFORMS Journal on Computing, Transportation Science, European Journal of Operational Research, among others. Artur was honored with the best doctoral dissertation award from the Brazilian Computer Society and has twice won the best paper award at the Brazilian OR Symposium. In addition, he received the 2017 Best Paper Prize from the journal Mathematical Programming Computation, and the 2022 Transportation Science Meritorious Service Award from INFORMS. Artur is one of the developers of the VRPSolver package and the Coluna branch-cut-and-price framework. He is also a co-author of the recent book “Optimizing with Column Generation”, written in collaboration with Eduardo Uchoa and Lorenza Moreno.

This week I am reading from Karl Svozil's book 'UFOs: Unidentified Aerial Phenomena: Observations, Explanations and Speculations'.Unidentified phenomena in space, in the Earth's atmosphere, and in waters are too important to leave their exploration to the military and scientific laypersons. Their proper scientific study is important for a variety of reasons; in particular, scientists and the public at large need to know the basic facts, to be informed about the way evidence is recorded, and to understand the difference been reliable evidence and fiction, as well as between plausible explanations and fantasy.With this objective, the book surveys the history of UFO observations, the variety of recorded phenomena, and recounts the efforts of investigative commissions and their published findings.Although wild rumors are demystified in the process, this is not an exercise in rumor-bashing. An open and at the same time critical mindset is the key. Many narratives and hypothesis appear implausible relative to our present state of knowledge; but this alone should not lead to their outright exclusion. Thus the author also pays attention to UFO sightings that have so far eluded explanation in terms of known physics or meteorology. Here the reader will encounter some of the more speculative but scientifically tenable proposals, for example, relating to sudden zigzag motion without apparent inertia or recognizable propulsion, yet always with a clear guide to their plausibility. Last but not least, the book outlines plans and suggestions for future research capable of revealing the existence and intentions of extraterrestrial intelligences, outer-space engineers, or technologies so far known only from science fiction.BioKarl Svozil (born 18 December 1956 in Vienna, Austria) is an Austrian physicist educated at the University of Vienna and Heidelberg University. Visiting scholar at the Lawrence Berkeley Laboratory of the University of California at Berkeley, US (1982–1983), the Lebedev Institute of the Moscow State University, and the Ioffe Institute, St. Petersburg (1986). Docent in Theoretical Physics at the Vienna Technical University. Ao. Univ. Professor at the Institute for Theoretical Physics of the Vienna Technical University. External Researcher at the Centre for Discrete Mathematics and Theoretical Computer Science[1] of the University of Auckland.Research in quantum theory, applications of computability theory, algorithmic information theory, constructive mathematics (in Errett Bishop's sense) in theoretical physics, equilibrium dynamics.Amazon link https://tinyurl.com/3ux346a4https://www.pastliveshypnosis.co.uk/https://www.patreon.com/alienufopodcast

In Episode 73, Patrick and Ciprian speak with returning guest Noson Yonofsky of Brooklyn College. The team discusses Quantum Mechanics, Einstein's Photoelectric Effect, Heisenberg's Uncertainty Principle, and the Quantum Eraser Experiment.Noson S. Yanofsky has a Ph.D. in mathematics from The Graduate Center of The City University of New York. He held a post-doctoral research position in McGill University in Montreal. Currently, he is a professor of computer science at Brooklyn College and The Graduate Center. In addition to writing research papers, he has authored Quantum Computing for Computer Scientists with Mirco Mannucci (Cambridge University Press), The Outer Limits of Reason: What Science, Mathematics, and Logic Cannot Tell Us (MIT Press), and Theoretical Computer Science for the Working Category Theorist (accepted for publication by Cambridge University Press). He is currently working on a book titled Monoidal Categories: A Unifying Concept in Mathematics, Physics, and Computers. Noson lives in Brooklyn with his wife and four children.Links to his  books can be found at: http://www.sci.brooklyn.cuny.edu/~noson/

This week I am talking to Karl Svozil about his his book 'UFOs: Unidentified Aerial Phenomena: Observations, Explanations and Speculations'.Unidentified phenomena in space, in the Earth's atmosphere, and in waters are too important to leave their exploration to the military and scientific laypersons. Their proper scientific study is important for a variety of reasons; in particular, scientists and the public at large need to know the basic facts, to be informed about the way evidence is recorded, and to understand the difference been reliable evidence and fiction, as well as between plausible explanations and fantasy.With this objective, the book surveys the history of UFO observations, the variety of recorded phenomena, and recounts the efforts of investigative commissions and their published findings.Although wild rumors are demystified in the process, this is not an exercise in rumor-bashing. An open and at the same time critical mindset is the key. Many narratives and hypothesis appear implausible relative to our present state of knowledge; but this alone should not lead to their outright exclusion. Thus the author also pays attention to UFO sightings that have so far eluded explanation in terms of known physics or meteorology. Here the reader will encounter some of the more speculative but scientifically tenable proposals, for example, relating to sudden zigzag motion without apparent inertia or recognizable propulsion, yet always with a clear guide to their plausibility. Last but not least, the book outlines plans and suggestions for future research capable of revealing the existence and intentions of extraterrestrial intelligences, outer-space engineers, or technologies so far known only from science fiction.BioKarl Svozil (born 18 December 1956 in Vienna, Austria) is an Austrian physicist educated at the University of Vienna and Heidelberg University. Visiting scholar at the Lawrence Berkeley Laboratory of the University of California at Berkeley, US (1982–1983), the Lebedev Institute of the Moscow State University, and the Ioffe Institute, St. Petersburg (1986). Docent in Theoretical Physics at the Vienna Technical University. Ao. Univ. Professor at the Institute for Theoretical Physics of the Vienna Technical University. External Researcher at the Centre for Discrete Mathematics and Theoretical Computer Science[1] of the University of Auckland.Research in quantum theory, applications of computability theory, algorithmic information theory, constructive mathematics (in Errett Bishop's sense) in theoretical physics, equilibrium dynamics.Amazon link https://tinyurl.com/3ux346a4https://www.pastliveshypnosis.co.uk/https://www.patreon.com/alienufopodcast

In this week's episode, I speak with Damien Desfontaines, also known by the pseudonym “Ted”, who is the Staff Scientist at Tumult Labs, a startup leading the way on differential privacy. In Damien's career, he has led an Anonymization Consulting Team at Google and specializes in making it easy to safely anonymize data. Damien earned his PhD and wrote his thesis at ETH Zurich, as well as his Master's Degree in Mathematical Logic and Theoretical Computer Science.Tumult Labs' platform makes differential privacy useful by making it easy to create innovative privacy and enabling data products that can be safely shared and used widely. In this conversation, we focus our discussion on Differential Privacy techniques, including what's next in its evolution, common vulnerabilities, and how to implement differential privacy into your platform.When it comes to protecting personal data, Tumult Labs has three stages in their approach. These are Assess, Design, and Deploy. Damien takes us on a deep dive into each with use cases provided.Topics Covered:Why there's such a gap between the academia and the corporate worldHow differential privacy's strong privacy guarantees are a result of strong assumptions; and why the biggest blockers to DP deployments have been eduction & usabilityWhen to use "local" vs "central" differential privacy techniquesAdvancements in technology that enable the private collection of dataTumult Labs' Assessment approach to deploying differential privacy, where a customer defines its 'data publication' problem or questionHow the Tumult Analytics platform can help you build different privacy algorithms that satisfies 'fitness for use' requirementsWhy using gold standard techniques like differential privacy to safely release, publish, or share data has value far beyond complianceHow data scientists can make the analysis & design more robust to better preserve privacy; and the tradeoff between utility on very specific tasks & number of tasks that you can possibly answerDamien's work assisting the IRS & DOE deploy differential privacy to safely publish and share data publicly via the College Scorecards projectHow to address security vulnerabilities (i.e. potential attacks) to differentially private datasetsWhere you can learn more about differential privacyHow Damien sees this space evolving over the next several yearsResources Mentioned:Join the Tumult Labs SlackLearn about Tumult LabsGuest Info:Connect with Damien on LinkedInLearn more on Damien's websiteFollow 'Ted' on Twitter Privado.ai Privacy assurance at the speed of product development. Get instant visibility w/ privacy code scans.Shifting Privacy Left Media Where privacy engineers gather, share, & learnDisclaimer: This post contains affiliate links. If you make a purchase, I may receive a commission at no extra cost to you.Copyright © 2022 - 2024 Principled LLC. All rights reserved.

In this episode of Brains, Black Holes, and Beyond, Senna Aldoubosh and Lina Kim sit down with Dr. Pedro Paredes, a professor and researcher in the Computer Science Department to learn more about his research with theoretical computer science. Aside from discussing his work, Dr. Paredes delves into what sparked his interest in the topic, and even includes a puzzle for listeners.This episode of Brains, Black Holes, and Beyond (B cubed) was produced under the 147th board of the Prince in partnership with the Insights newsletter.For more information about Dr. Paredes and his research, feel free to visit the page linked below.RESOURCEShttps://www.cs.princeton.edu/~pparedes/CREDITSWritten and Hosted by Senna Aldoubosh and Lina KimEdited and Sound Engineered by Lina KimTranscript by Eden TeshomeProduced by Senna AldouboshFor more from the Daily Princetonian, visit dailyprincetonian.com. For more from Princeton Insights, visit insights.princeton.edu. Please direct all corrections to corrections@dailyprincetonian.com.

Seg 1 - It's both a cat and a robot and it's probably better at chess than you are! Guest: Kenneth Regan, Professor of Theoretical Computer Science and Engineering at the University of Buffalo and Co-Author of the most-read Computer Science Blog “Gödel's Losts Letter, P=MP” Seg 2 - If you didn't get a jump on ‘dry January', don't worry, there is another month this year that you can give it a go. Guest: Lynn Murad, Spokesperson for the Canadian Cancer Society Seg 3 - There is an increase in companies who are relying on AI tools and software to aid in the hiring practices of their business. But can AI miss potentially great candidates? Guest: Joseph Fuller, Professor of Management Practice and Co-Lead of Managing the Future of Work Initiative at the Harvard School of Business Seg 4 - How do you start designing a single zone multiplex building? Guest: Brian Billingsley, Principal Architect at B Squared Architecture Inc. Seg 5 - Could a lack of funding be responsible for shutting down BC RCMP's body camera pilot project? Guest: Craig Hodge, Coquitlam City Councillor and Member of the Coquitlam Joint Police Detachment Advisory Committee Seg 6 - Celebrating the Lunar New Year in Metro Vancouver Guest: Carol Lee, Chair of the Vancouver Chinatown Foundation Guest: April Liu, Director of Education and Programming at the Chinatown Storytelling Centre Learn more about your ad choices. Visit megaphone.fm/adchoices

It's both a cat and a robot and it's probably better at chess than you are! Guest: Kenneth Regan, Professor of Theoretical Computer Science and Engineering at the University of Buffalo and Co-Author of the most-read Computer Science Blog “Gödel's Losts Letter, P=MP” Learn more about your ad choices. Visit megaphone.fm/adchoices

Podcast: (CS)²AI Podcast Show: Control System Cyber SecurityEpisode: 64: Education That Alters Your Career TrajectoryPub date: 2023-01-10Today, Markus Braendle joins Derek Harp as his guest for today's show. He is Head of Information and Automotive Security at the Volkswagen company, CARIAD. Markus has been in the industry for a long time! He is a high-energy and result-driven professional offering extensive leadership and business experience. He has a proven track record of building, strengthening, and leading international teams, evolving organizations to meet future needs, as well as creating a customer-focused culture. He is confident and engaging with refined communication skills. He brings deep technical know-how to areas of information technology, cyber security, or industrial automation.Markus was born in Iran and grew up in a small town near Zurich, Switzerland. In addition to being a technologist and an all-around geek, he is also a husband, father, hobby carpenter, mountain biker, and formally-trained software engineer. In this episode, he tells his story, discusses his education and career trajectory, and gets into what they are doing at CARIAD.Stay tuned for more!Show highlights:His dad was into technology, and it became clear early on that Markus would also go into technology.He studied for four years to get his Master's in Computer Science and then did a P.h.D. in Theoretical Computer Science.Markus talks about the value of the year he spent in the US as an exchange student.He explains why he ended up in a corporate research lab after completing his studies.Markus discusses his first intersections with control systems and cybersecurity.How Markus learned to always ask about the most important thing a product does before trying to link security to it.Markus discusses his approach to building a network to advance your career.The qualities Markus looks for in candidates when interviewing them.What diversity means to him, and why he feels it is essential when building teams.How Markus discovered the benefits of working with people with autism.Why he left ABB to join Airbus, and why he joined Cariad eight months ago.Markus shares some advice for what people starting in their careers should study.Mentioned in this episode:Our Sponsors:We'd like to thank our sponsors for their faithful support of this podcast. Without their support we would not be able to bring you this valuable content. We'd appreciate it if you would support these companies because they support us! Network Perception Waterfall Security Tripwire KPMG CyberJoin CS2AIJoin the largest organization for cybersecurity professionals. Membership has its benefits! We keep you up to date on the latest cybersecurity news and education. Preroll MembershipThe podcast and artwork embedded on this page are from Derek Harp, which is the property of its owner and not affiliated with or endorsed by Listen Notes, Inc.

Today, Markus Braendle joins Derek Harp as his guest for today's show. He is Head of Information and Automotive Security at the Volkswagen company, CARIAD. Markus has been in the industry for a long time! He is a high-energy and result-driven professional offering extensive leadership and business experience. He has a proven track record of building, strengthening, and leading international teams, evolving organizations to meet future needs, as well as creating a customer-focused culture. He is confident and engaging with refined communication skills. He brings deep technical know-how to areas of information technology, cyber security, or industrial automation.Markus was born in Iran and grew up in a small town near Zurich, Switzerland. In addition to being a technologist and an all-around geek, he is also a husband, father, hobby carpenter, mountain biker, and formally-trained software engineer. In this episode, he tells his story, discusses his education and career trajectory, and gets into what they are doing at CARIAD.Stay tuned for more!Show highlights:His dad was into technology, and it became clear early on that Markus would also go into technology.He studied for four years to get his Master's in Computer Science and then did a P.h.D. in Theoretical Computer Science.Markus talks about the value of the year he spent in the US as an exchange student.He explains why he ended up in a corporate research lab after completing his studies.Markus discusses his first intersections with control systems and cybersecurity.How Markus learned to always ask about the most important thing a product does before trying to link security to it.Markus discusses his approach to building a network to advance your career.The qualities Markus looks for in candidates when interviewing them.What diversity means to him, and why he feels it is essential when building teams.How Markus discovered the benefits of working with people with autism.Why he left ABB to join Airbus, and why he joined Cariad eight months ago.Markus shares some advice for what people starting in their careers should study.

Dr. Jaroslav Nešetřil is a Professor of Mathematics and the Founder of the Centre for Discrete Mathematics, Theoretical Computer Science and its Applications, Charles University, Prague, Czech Republic. Dr. Nešetřil, among other many national and international distinctions, received the Donatio Universitatis Carolinae prize “for his contribution to mathematics and for his leading role in establishing a world-renowned group in discrete mathematics at Charles University”. In a conversation with students from Simon Fraser University, Brian Krammer, Anmol Anmol Singh, and Amritha Raj Kizhakkeputhukulathil Ramanan, Dr. Nešetřil talks about how the world events in 1963 influenced his decision to go to university, reflects on many contributions that his generation made to the establishment of the theoretical computing science, and shares his views about the relationship between mathematics and art.

This episode is about the journey of a programmer that converted himself into a Haskell developer after working with C/C++ for more than 10years. Here are a few questions that you'll find the answer to in this episode: What does he find so compelling about Haskell? Why did it make him dive deeper into the Theoretical Computer Science? Why did it make him learn Coq and Category Theory? How does Coq compare with ACL2? How do both Coq and ACL2 compares to TLA+? Did learning Coq make John a better programmer? Links John's Email: johnw@newartisans.com John's Twitter: @jwiegley

This episode is about the journey of a programmer that converted himself into a Haskell developer after working with C/C++ for more than 10years. Here are a few questions that you'll find the answer to in this episode: What does he find so compelling about Haskell? Why did it make him dive deeper into the Theoretical Computer Science? Why did it make him learn Coq and Category Theory? How does Coq compare with ACL2? How do both Coq and ACL2 compares to TLA+? Did learning Coq make John a better programmer? Links John's Email: johnw@newartisans.com John's Twitter: @jwiegley

This episode is about the journey of a programmer that converted himself into a Haskell developer after working with C/C++ for more than 10years. Here are a few questions that you'll find the answer to in this episode: What does he find so compelling about Haskell? Why did it make him dive deeper into the Theoretical Computer Science? Why did it make him learn Coq and Category Theory? How does Coq compare with ACL2? How do both Coq and ACL2 compares to TLA+? Did learning Coq make John a better programmer? Links John's Email: johnw@newartisans.com John's Twitter: @jwiegley

Timestamps(1:55) Alba shared her background growing up interested in studying Physics and pivoting into quantum mechanics.(3:33) Alba went over her Bachelor’s in Fundamental Physics at The University of Barcelona.(4:54) Alba continued her education with an M.S. degree that specialized in Particle Physics and Gravitation.(6:40) Alba started her Ph.D. in Physics in 2015 and discussed her first publication, “Operational Approach to Bell Inequalities: Application to Qutrits.”(9:48) Alba also spent time as a visiting scholar at the University of Oxford and the University of Madrid during her Ph.D.(11:25) Alba explained her second paper to understand the connection between maximal entanglement and the fundamental symmetries of high-energy physics.(13:27) Alba dissected her next work titled “Multipartite Entanglement in Spin Chains and The Hyperdeterminant.”(18:56) Alba shared the origin of Quantic, a quantum computation joint effort between the University of Barcelona and the Barcelona Supercomputing Center.(22:27) Alba unpacked her article “Quantum Computation: Playing The Quantum Symphony,” making a metaphor between quantum computing and musical symphony.(27:47) Alba discussed the motivation and contribution of her paper “Exact Ising Model Simulation On A Quantum Computer.”(32:51) Alba recalled creating a tutorial that ended up winning the Teach Me QISKit challenge from IBM back in 2018.(35:01) Alba elaborated on her paper “Quantum Circuits For the Maximally Entangled States,” which designs a series of quantum circuits that generate absolute maximally entangled states to benchmark a quantum computer.(38:54) Alba dissected key ideas in her paper “Data Re-Uploading For a Universal Quantum Classifier.”(43:51) Alba explained how she leveled up her knowledge of classical neural networks.(47:40) Alba shared her experience as a Postdoctoral Fellow at The Matter Lab at the University of Toronto — working on quantum machine learning and variational quantum algorithms (checked out the Quantum Research Seminars Toronto that she has been organizing).(52:18) Alba explained her work on the Meta-Variational Quantum Eigensolver algorithm capable of learning the ground state energy profile of a parametrized Hamiltonian.(59:23) Alba went over Tequila, a development package for quantum algorithms in Python that her group created.(01:04:49) Alba presented a quantum calling for new algorithms, applications, architectures, quantum-classical interface, and more (as presented here).(01:08:59) Alba has been active in education and public outreach activities about encouraging scientific vocations for young minds, especially in Catalonia.(01:12:07) Closing segment.Her Contact InfoWebsiteTwitterLinkedInGoogle ScholarGitHubHer Recommended ResourcesEwin Tang (Ph.D. Student in Theoretical Computer Science at the University of Washington)Alán Aspuru-Guzik (Professor of Chemistry and Computer Science at the University of Toronto, Alba’s current supervisor)José Ignacio Latorre (Professor of Theoretical Physics at the University of Barcelona, Alba’s former supervisor)Quantum Computation and Quantum Information (by Michael Nielsen and Isaac Chuang)Quantum Field Theory and The Standard Model (by Matthew Schwarz)The Structure of Scientific Revolutions (by Thomas Kuhn)Against Method (by Paul Feyerabend)Quantum Computing Since Democritus (by Scott Aaronson)

Timestamps(1:55) Alba shared her background growing up interested in studying Physics and pivoting into quantum mechanics.(3:33) Alba went over her Bachelor’s in Fundamental Physics at The University of Barcelona.(4:54) Alba continued her education with an M.S. degree that specialized in Particle Physics and Gravitation.(6:40) Alba started her Ph.D. in Physics in 2015 and discussed her first publication, “Operational Approach to Bell Inequalities: Application to Qutrits.”(9:48) Alba also spent time as a visiting scholar at the University of Oxford and the University of Madrid during her Ph.D.(11:25) Alba explained her second paper to understand the connection between maximal entanglement and the fundamental symmetries of high-energy physics.(13:27) Alba dissected her next work titled “Multipartite Entanglement in Spin Chains and The Hyperdeterminant.”(18:56) Alba shared the origin of Quantic, a quantum computation joint effort between the University of Barcelona and the Barcelona Supercomputing Center.(22:27) Alba unpacked her article “Quantum Computation: Playing The Quantum Symphony,” making a metaphor between quantum computing and musical symphony.(27:47) Alba discussed the motivation and contribution of her paper “Exact Ising Model Simulation On A Quantum Computer.”(32:51) Alba recalled creating a tutorial that ended up winning the Teach Me QISKit challenge from IBM back in 2018.(35:01) Alba elaborated on her paper “Quantum Circuits For the Maximally Entangled States,” which designs a series of quantum circuits that generate absolute maximally entangled states to benchmark a quantum computer.(38:54) Alba dissected key ideas in her paper “Data Re-Uploading For a Universal Quantum Classifier.”(43:51) Alba explained how she leveled up her knowledge of classical neural networks.(47:40) Alba shared her experience as a Postdoctoral Fellow at The Matter Lab at the University of Toronto — working on quantum machine learning and variational quantum algorithms (checked out the Quantum Research Seminars Toronto that she has been organizing).(52:18) Alba explained her work on the Meta-Variational Quantum Eigensolver algorithm capable of learning the ground state energy profile of a parametrized Hamiltonian.(59:23) Alba went over Tequila, a development package for quantum algorithms in Python that her group created.(01:04:49) Alba presented a quantum calling for new algorithms, applications, architectures, quantum-classical interface, and more (as presented here).(01:08:59) Alba has been active in education and public outreach activities about encouraging scientific vocations for young minds, especially in Catalonia.(01:12:07) Closing segment.Her Contact InfoWebsiteTwitterLinkedInGoogle ScholarGitHubHer Recommended ResourcesEwin Tang (Ph.D. Student in Theoretical Computer Science at the University of Washington)Alán Aspuru-Guzik (Professor of Chemistry and Computer Science at the University of Toronto, Alba’s current supervisor)José Ignacio Latorre (Professor of Theoretical Physics at the University of Barcelona, Alba’s former supervisor)Quantum Computation and Quantum Information (by Michael Nielsen and Isaac Chuang)Quantum Field Theory and The Standard Model (by Matthew Schwarz)The Structure of Scientific Revolutions (by Thomas Kuhn)Against Method (by Paul Feyerabend)Quantum Computing Since Democritus (by Scott Aaronson)

Find out more on our website: https://bit.ly/3Jzlmz9 Functional programmers have long claimed that languages such as Haskell and O'Caml allow one to write code more quickly and more reliably. Widespread uptake of functional programming among the financial community supports that claim, and this talk will examine a few cases. Speaker: Philip Wadler is Professor of Theoretical Computer Science at the University of Edinburgh and Senior Research Fellow at IOHK. He is an ACM Fellow, a Fellow of the Royal Society of Edinburgh, and editor-in-chief of Proceedings of the ACM for Programming Languages. He is past chair of ACM SIGPLAN, past holder of a Royal Society-Wolfson Research Merit Fellowship, winner of the SIGPLAN Distinguished Service Award, and a winner of the POPL Most Influential Paper Award. Previously, he worked or studied at Stanford, Xerox Parc, CMU, Oxford, Chalmers, Glasgow, Bell Labs, and Avaya Labs, and visited as a guest professor in Copenhagen, Sydney, and Paris. He has an h-index of over 70 with more than 25,000 citations to his work, according to Google Scholar. He contributed to the designs of Haskell, Java, and XQuery, and is co-author of Introduction to Functional Programming (Prentice Hall, 1988), XQuery from the Experts (Addison Wesley, 2004), Generics and Collections in Java (O'Reilly, 2006), and Programming Language Foundations in Agda (2018). He has delivered invited talks in locations ranging from Aizu to Zurich.

In this special bonus episode of the podcast, I’m joined by Ewin Tang, a PhD student in the Theoretical Computer Science group at the University of Washington. In our conversation, Ewin and I dig into her paper “A quantum-inspired classical algorithm for recommendation systems,” which took the quantum computing community by storm last summer. We haven’t called out a Nerd-Alert interview in a long time, but this interview inspired us to dust off that designation, so get your notepad ready! The complete show notes for this episode can be found at https://twimlai.com/talk/246.

Rosi Sexton is a true renaissance woman. She fought in BodogFight, EliteXC, Cage Warriors and was the first British Woman to fight in the UFC.  But she's also Cambridge educated with a PhD in Theoretical Computer Science, a musician, a writer and a physical therapist. So she knows a thing or two... In this episode we talk about learning new skills, improving in combat sports, and overcoming injuries.  From about 38 minutes on we concentrate on neck injuries and the role of neck strengthening in minimising concussion in combat sports.  This is an extremely important episode for all martial artists! Check out the "Safe Neck Strengthening for BJJ, with UFC Fighter Rosi Sexton" video that Rosi shot for my Youtube channel at https://www.youtube.com/watch?v=04ff_tgZGI0 And check out her site at https://www.combatsportsclinic.net/  

Philip Wadler is a Professor of Theoretical Computer Science at the University of Edinburgh and a Senior Research Fellow for IOHK. In this episode he discusses the Plutus programming language used for smart contracts on the Cardano Platform. Watch Episode 10 and view more information on Youtube: https://youtu.be/8P_cZ5V0-4I

Yves Bertot is a senior researcher that the French Institute for Research in Computer Science and Automation (INRIA) in Sophia Antipolis and a leading researcher on correctness of software and the verification of mathematical proofs. Recently, his team was able to formally verify the correctness of the computation on the one millionth decimal digit of pi (which is 1, by the way), including a formally verifiable proof of the mathematics behind the formula and the correctness of the implementation of arithmetic operations used in the computation. We use this result as an inspiration to talk about interactive theorem proving and improving software quality. Yves’ book with Pierre Casterán about interactive theorem proving using the Coq system is “Interactive Theorem Proving and Program Development – Coq'Art: The Calculus of Inductive Constructions”, Springer Verlag, EATCS Texts in Theoretical Computer Science, 2004, ISBN 3-540-20854-2.

Yves Bertot is a senior researcher that the French Institute for Research in Computer Science and Automation (INRIA) in Sophia Antipolis and a leading researcher on correctness of software and the verification of mathematical proofs. Recently, his team was able to formally verify the correctness of the computation on the one millionth decimal digit of pi (which is 1, by the way), including a formally verifiable proof of the mathematics behind the formula and the correctness of the implementation of arithmetic operations used in the computation. We use this result as an inspiration to talk about interactive theorem proving and improving software quality. Yves’ book with Pierre Casterán about interactive theorem proving using the Coq system is “Interactive Theorem Proving and Program Development – Coq'Art: The Calculus of Inductive Constructions”, Springer Verlag, EATCS Texts in Theoretical Computer Science, 2004, ISBN 3-540-20854-2.

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2

Claire Mathieu Collège de France Informatique et sciences numériques (2017-2018) partenariat Inria Algorithmes Bibliographie Les numéros de pages font référence aux diapositives utilisées pour le cours. p. 4-13 et p. 22 Easley D. et Kleinberg J., "Networks, Crowds, and Markets: Reasoning About a Highly Connected World" Sections 13.1 et 13.2 Accéder au site p. 7-13 Bush V., "As We May Think", juillet 1945 Accéder au site p. 15-20 Easley-Kleinberg, Section 18.7 p. 23-29 Kanade V., Levi R., Lotker Z., Mallmann-Trenn F., Mathieu C., "Distance in the Forest Fire Model: How far are you from Eve?", ACM-SIAM SODA (Symposium on Discrete Algorithms), 2016 Accéder au PDF p. 30-39 Avin C., Keller B., Lotker Z., Mathieu C., Peleg D., Pignolet Y.-A., "Homophily and the Glass Ceiling Effect in Social Networks", ITCS (Innovations in Theoretical Computer Science), 2015 Accéder au PDF p. 41 Easley-Kleinberg, Section 16.2