Symposium on Discrete Algorithms Science (SODA) 2018 Travel Grant
离散算法科学研讨会 (SODA) 2018 年旅费资助
基本信息
- 批准号:1807311
- 负责人:
- 金额:$ 1.5万
- 依托单位:
- 依托单位国家:美国
- 项目类别:Standard Grant
- 财政年份:2018
- 资助国家:美国
- 起止时间:2018-01-15 至 2018-12-31
- 项目状态:已结题
- 来源:
- 关键词:
项目摘要
This award will help support student and postdoctoral attendance at the Annual ACM/SIAM Symposium on Discrete Algorithms Science (SODA) 2018, which will be held January 7-10 2018 in New Orleans, Louisiana. SODA is co-sponsored by the Association for Computing Machinery (ACM) and the Society for Industrial and Applied Mathematics (SIAM) . SODA is the premier annual research conference in the field of discrete algorithms and one of the three premier conferences in theoretical computer science. SODA has been meeting annually since 1990 and in a typical year has over 300 attendees. It is co-located with two smaller workshops, ALENEX (Meeting on Algorithm Engineering and Experimentation) and ANALCO (Meeting on Analysis of Algorithms). SODA is attended by researchers from all over the world. The field of algorithms is a vibrant one, with high participation rates from young researchers, and many papers with student authors. For these student authors and student attendees, the conference serves as a valuable educational experience, both for the technical content of the talks and for the opportunities for networking that it provides. The award will provide partial support to approximately twenty students, partly defraying the cost of travel and lodging. Efforts will be made to support students from under-represented groups.
该奖项将帮助学生和博士后参加将于2018年1月7日至10日在路易斯安那州新奥尔良举行的2018年ACM/SIAM离散算法科学研讨会(SODA)。SODA是由计算机协会(ACM)和工业与应用数学协会(SIAM)共同发起的。SODA是离散算法领域的顶级年度研究会议,也是理论计算机科学领域的三大顶级会议之一。SODA自1990年以来每年举行一次会议,通常每年有300多名与会者。它与两个较小的研讨会,ALENEX(算法工程和实验会议)和ANALCO(算法分析会议)位于同一地点。SODA由来自世界各地的研究人员参加。算法领域是一个充满活力的领域,年轻研究人员的参与率很高,许多论文由学生作者撰写。对于这些学生作者和学生与会者来说,会议提供了宝贵的教育经验,无论是会谈的技术内容还是它提供的网络机会。该奖项将为大约20名学生提供部分支持,部分支付旅费和住宿费。将努力支持来自代表性不足群体的学生。
项目成果
期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)
数据更新时间:{{ journalArticles.updateTime }}
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
数据更新时间:{{ journalArticles.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ monograph.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ sciAawards.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ conferencePapers.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ patent.updateTime }}
Clifford Stein其他文献
An <math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll" class="math"><mi>O</mi><mo stretchy="false">(</mo><msup><mi>n</mi><mrow><mn>5</mn><mo stretchy="false">/</mo><mn>2</mn></mrow></msup><mi mathvariant="normal">log</mi><mi>n</mi><mo stretchy="false">)</mo></math> algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions
- DOI:
10.1016/j.comgeo.2008.04.006 - 发表时间:
2009-07-01 - 期刊:
- 影响因子:
- 作者:
David P. Wagner;Robert Scot Drysdale;Clifford Stein - 通讯作者:
Clifford Stein
Theory of Computing
计算理论
- DOI:
10.4086/toc - 发表时间:
2013 - 期刊:
- 影响因子:0
- 作者:
Alexandr Andoni;Nikhil Bansal;P. Beame;Giuseppe Italiano;Sanjeev Khanna;Ryan O’Donnell;T. Pitassi;T. Rabin;Tim Roughgarden;Clifford Stein;Rocco Servedio;Amir Abboud;Nima Anari;Ibm Srinivasan Arunachalam;T. J. Watson;Research Center;Petra Berenbrink;Aaron Bernstein;Aditya Bhaskara;Sayan Bhattacharya;Eric Blais;H. Bodlaender;Adam Bouland;Anne Broadbent;Mark Bun;Timothy Chan;Arkadev Chattopadhyay;Xue Chen;Gil Cohen;Dana Dachman;Anindya De;Shahar Dobzhinski;Zhiyi Huang;Ken;Robin Kothari;Marvin Künnemann;Tu Kaiserslautern;Rasmus Kyng;E. Zurich;Sophie Laplante;D. Lokshtanov;S. Mahabadi;Nicole Megow;Ankur Moitra;Technion Shay Moran;Google Research;Christopher Musco;Prasad Raghavendra;Alex Russell;Laura Sanità;Alex Slivkins;David Steurer;Epfl Ola Svensson;Chaitanya Swamy;Madhur Tulsiani;Christos Tzamos;Andreas Wiese;Mary Wootters;Huacheng Yu;Aaron Potechin;Aaron Sidford;Aarushi Goel;Aayush Jain;Abhiram Natarajan;Abhishek Shetty;Adam Karczmarz;Adam O’Neill;Aditi Dudeja;Aditi Laddha;Aditya Krishnan;Adrian Vladu Afrouz;J. Ameli;Ainesh Bakshi;Akihito Soeda;Akshay Krishnamurthy;Albert Cheu;A. Grilo;Alex Wein;Alexander Belov;Alexander Block;Alexander Golovnev;Alexander Poremba;Alexander Shen;Alexander Skopalik;Alexandra Henzinger;Alexandros Hollender;Ali Parviz;Alkis Kalavasis;Allen Liu;Aloni Cohen;Amartya Shankha;Biswas Amey;Bhangale Amin;Coja;Yehudayoff Amir;Zandieh Amit;Daniely Amit;Kumar Amnon;Ta;Beimel Anand;Louis Anand Natarajan;Anders Claesson;André Chailloux;André Nusser;Andrea Coladangelo;Andrea Lincoln;Andreas Björklund;Andreas Maggiori;A. Krokhin;A. Romashchenko;Andrej Risteski;Anirban Chowdhury;Anirudh Krishna;A. Mukherjee;Ankit Garg;Anna Karlin;Anthony Leverrier;Antonio Blanca;A. Antoniadis;Anupam Gupta;Anupam Prakash;A. Singh;Aravindan Vijayaraghavan;Argyrios Deligkas;Ariel Kulik;Ariel Schvartzman;Ariel Shaulker;A. Cornelissen;Arka Rai;Choudhuri Arkady;Yerukhimovich Arnab;Bhattacharyya Arthur Mehta;Artur Czumaj;A. Backurs;A. Jambulapati;Ashley Montanaro;A. Sah;A. Mantri;Aviad Rubinstein;Avishay Tal;Badih Ghazi;Bartek Blaszczyszyn;Benjamin Moseley;Benny Pinkas;Bento Natura;Bernhard Haeupler;Bill Fefferman;B. Mance;Binghui Peng;Bingkai Lin;B. Sinaimeri;Bo Waggoner;Bodo Manthey;Bohdan Kivva;Brendan Lucier Bundit;Laekhanukit Burak;Sahinoglu Cameron;Seth Chaodong Zheng;Charles Carlson;Chen;Chenghao Guo;Chenglin Fan;Chenwei Wu;Chethan Kamath;Chi Jin;J. Thaler;Jyun;Kaave Hosseini;Kaito Fujii;Kamesh Munagala;Kangning Wang;Kanstantsin Pashkovich;Karl Bringmann Karol;Wegrzycki Karteek;Sreenivasaiah Karthik;Chandrasekaran Karthik;Sankararaman Karthik;C. S. K. Green;Larsen Kasturi;Varadarajan Keita;Xagawa Kent Quanrud;Kevin Schewior;Kevin Tian;Kilian Risse;Kirankumar Shiragur;K. Pruhs;K. Efremenko;Konstantin Makarychev;Konstantin Zabarnyi;Krišj¯anis Pr¯usis;Kuan Cheng;Kuikui Liu;Kunal Marwaha;Lars Rohwedder László;Kozma László;A. Végh;L'eo Colisson;Leo de Castro;Leonid Barenboim Letong;Li;Li;L. Roditty;Lieven De;Lathauwer Lijie;Chen Lior;Eldar Lior;Rotem Luca Zanetti;Luisa Sinisclachi;Luke Postle;Luowen Qian;Lydia Zakynthinou;Mahbod Majid;Makrand Sinha;Malin Rau Manas;Jyoti Kashyop;Manolis Zampetakis;Maoyuan Song;Marc Roth;Marc Vinyals;Marcin Bieńkowski;Marcin Pilipczuk;Marco Molinaro;Marcus Michelen;Mark de Berg;M. Jerrum;Mark Sellke;Mark Zhandry;Markus Bläser;Markus Lohrey;Marshall Ball;Marthe Bonamy;Martin Fürer;Martin Hoefer;M. Kokainis;Masahiro Hachimori;Matteo Castiglioni;Matthias Englert;Matti Karppa;Max Hahn;Max Hopkins;Maximilian Probst;Gutenberg Mayank Goswami;Mehtaab Sawhney;Meike Hatzel;Meng He;Mengxiao Zhang;Meni Sadigurski;M. Parter;M. Dinitz;Michael Elkin;Michael Kapralov;Michael Kearns;James R. Lee;Sudatta Bhattacharya;Michal Koucký;Hadley Black;Deeparnab Chakrabarty;C. Seshadhri;Mahsa Derakhshan;Naveen Durvasula;Nika Haghtalab;Peter Kiss;Thatchaphol Saranurak;Soheil Behnezhad;M. Roghani;Hung Le;Shay Solomon;Václav Rozhon;Anders Martinsson;Christoph Grunau;G. Z. —. Eth;Zurich;Switzerland;Morris Yau — Massachusetts;Noah Golowich;Dhruv Rohatgi — Massachusetts;Qinghua Liu;Praneeth Netrapalli;Csaba Szepesvári;Debarati Das;Jacob Gilbert;Mohammadtaghi Hajiaghayi;Tomasz Kociumaka;B. Saha;K. Bringmann;Nick Fischer — Weizmann;Ce Jin;Yinzhan Xu — Massachusetts;Virginia Vassilevska Williams;Yinzhan Xu;Josh Alman;Kevin Rao;Hamed Hatami;—. XiangMeng;McGill University;Edith Cohen;Xin Lyu;Tamás Jelani Nelson;Uri Stemmer — Google;Research;Daniel Alabi;Pravesh K. Kothari;Pranay Tankala;Prayaag Venkat;Fred Zhang;Samuel B. Hopkins;Gautam Kamath;Shyam Narayanan — Massachusetts;Marco Gaboardi;R. Impagliazzo;Rex Lei;Satchit Sivakumar;Jessica Sorrell;T. Korhonen;Marco Bressan;Matthias Lanzinger;Huck Bennett;Mahdi Cheraghchi;V. Guruswami;João Ribeiro;Jan Dreier;Nikolas Mählmann;Sebastian Siebertz — TU Wien;The Randomized k ;Conjecture Is;False;Sébastien Bubeck;Christian Coester;Yuval Rabani — Microsoft;Wei;Ethan Mook;Daniel Wichs;Joshua Brakensiek;Sai Sandeep — Stanford;University;Lorenzo Ciardo;Stanislav Živný;Amey Bhangale;Subhash Khot;Dor Minzer;David Ellis;Guy Kindler;Noam Lifshitz;Ronen Eldan;Dan Mikulincer;George Christodoulou;E. Koutsoupias;Annamária Kovács;José Correa;Andrés Cristi;Xi Chen;Matheus Venturyne;Xavier Ferreira;David C. Parkes;Yang Cai;Jinzhao Wu;Zhengyang Liu;Zeyu Ren;Zihe Wang;Ravishankar Krishnaswamy;Shi Li;Varun Suriyanarayana - 通讯作者:
Varun Suriyanarayana
Energy-Efficient Scheduling with Predictions
带预测的节能调度
- DOI:
- 发表时间:
2024 - 期刊:
- 影响因子:0
- 作者:
Eric Balkanski;Noémie Périvier;Clifford Stein;Hao - 通讯作者:
Hao
Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity
匹配理论中的内部封闭性和冯·诺依曼-摩根斯坦稳定性:结构和复杂性
- DOI:
10.48550/arxiv.2211.17050 - 发表时间:
2022 - 期刊:
- 影响因子:0
- 作者:
Yuri Faenza;Clifford Stein;Jia Wan - 通讯作者:
Jia Wan
A parallel algorithm for approximating the minimum cycle cover
- DOI:
10.1007/bf01185336 - 发表时间:
1993-01-01 - 期刊:
- 影响因子:0.700
- 作者:
Philip Klein;Clifford Stein - 通讯作者:
Clifford Stein
Clifford Stein的其他文献
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
{{ truncateString('Clifford Stein', 18)}}的其他基金
Collaborative Research: AF: Small: Efficient Massively Parallel Algorithms
合作研究:AF:小型:高效大规模并行算法
- 批准号:
2218677 - 财政年份:2022
- 资助金额:
$ 1.5万 - 项目类别:
Standard Grant
Symposium on Discrete Algorithms Science (SODA) 2019 Travel Grant
离散算法科学研讨会(SODA)2019年旅费资助
- 批准号:
1906903 - 财政年份:2019
- 资助金额:
$ 1.5万 - 项目类别:
Standard Grant
SPX: Collaborative Research: Moving Towards Secure and Massive Parallel Computing
SPX:协作研究:迈向安全和大规模并行计算
- 批准号:
1822809 - 财政年份:2018
- 资助金额:
$ 1.5万 - 项目类别:
Standard Grant
AF:Small:Beyond Worst Case Running time: Algorithms for Routing, Scheduling and Matching
AF:小:超越最坏情况运行时间:路由、调度和匹配算法
- 批准号:
1714818 - 财政年份:2017
- 资助金额:
$ 1.5万 - 项目类别:
Standard Grant
AF:Small:Scheduling and Routing: Algorithms with novel cost measures
AF:Small:调度和路由:具有新颖成本度量的算法
- 批准号:
1421161 - 财政年份:2014
- 资助金额:
$ 1.5万 - 项目类别:
Standard Grant
AF: EAGER: Scheduling with Resource Contraints
AF:EAGER:具有资源约束的调度
- 批准号:
1349602 - 财政年份:2013
- 资助金额:
$ 1.5万 - 项目类别:
Standard Grant
相似海外基金
Quantum algorithms for discrete spacetimes
离散时空的量子算法
- 批准号:
2882937 - 财政年份:2023
- 资助金额:
$ 1.5万 - 项目类别:
Studentship
Analysis of algorithms for resouce allocation: an approach from market design and discrete convex analysis
资源分配算法分析:市场设计和离散凸分析的方法
- 批准号:
22KJ0717 - 财政年份:2023
- 资助金额:
$ 1.5万 - 项目类别:
Grant-in-Aid for JSPS Fellows
Algorithms for large-scale discrete optimization problems arising in logistics and machine learning
物流和机器学习中出现的大规模离散优化问题的算法
- 批准号:
RGPIN-2020-06311 - 财政年份:2022
- 资助金额:
$ 1.5万 - 项目类别:
Discovery Grants Program - Individual
Algorithms for large-scale discrete optimization problems arising in logistics and machine learning
物流和机器学习中出现的大规模离散优化问题的算法
- 批准号:
RGPIN-2020-06311 - 财政年份:2022
- 资助金额:
$ 1.5万 - 项目类别:
Discovery Grants Program - Individual
Algorithms for large-scale discrete optimization problems arising in logistics and machine learning
物流和机器学习中出现的大规模离散优化问题的算法
- 批准号:
RGPIN-2020-06311 - 财政年份:2021
- 资助金额:
$ 1.5万 - 项目类别:
Discovery Grants Program - Individual
Discrete disordered systems: extremes, algorithms, and optimization.
离散无序系统:极值、算法和优化。
- 批准号:
RGPIN-2017-04330 - 财政年份:2021
- 资助金额:
$ 1.5万 - 项目类别:
Discovery Grants Program - Individual
Algorithms for some hard discrete nonlinear optimization problems and applications
一些硬离散非线性优化问题的算法及应用
- 批准号:
RGPIN-2015-06342 - 财政年份:2020
- 资助金额:
$ 1.5万 - 项目类别:
Discovery Grants Program - Individual
Algorithms for large-scale discrete optimization problems arising in logistics and machine learning
物流和机器学习中出现的大规模离散优化问题的算法
- 批准号:
RGPIN-2020-06311 - 财政年份:2020
- 资助金额:
$ 1.5万 - 项目类别:
Discovery Grants Program - Individual
Discrete disordered systems: extremes, algorithms, and optimization.
离散无序系统:极值、算法和优化。
- 批准号:
RGPIN-2017-04330 - 财政年份:2020
- 资助金额:
$ 1.5万 - 项目类别:
Discovery Grants Program - Individual
Modeling and Algorithms for Discrete Problems
离散问题的建模和算法
- 批准号:
20K04978 - 财政年份:2020
- 资助金额:
$ 1.5万 - 项目类别:
Grant-in-Aid for Scientific Research (C)