default search action
Dimitrios Vytiniotis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i13]Sami Alabed, Bart Chrzaszcz, Juliana Franco, Dominik Grewe, Dougal Maclaurin, James Molloy, Tom Natan, Tamara Norman, Xiaoyue Pan, Adam Paszke, Norman A. Rink, Michael Schaarschmidt, Timur Sitdikov, Agnieszka Swietlik, Dimitrios Vytiniotis, Joel Wee:
PartIR: Composing SPMD Partitioning Strategies for Machine Learning. CoRR abs/2401.11202 (2024) - 2023
- [e1]Stefanos Laskaridis, Alexey Tumanov, Nathalie Baracaldo, Dimitrios Vytiniotis:
Proceedings of the 4th International Workshop on Distributed Machine Learning, DistributedML 2023, Paris, France, 8 December 2023. ACM 2023 [contents] - 2022
- [c40]Ningning Xie, Tamara Norman, Dominik Grewe, Dimitrios Vytiniotis:
Synthesizing Optimal Parallelism Placement and Reduction Strategies on Hierarchical Systems for Deep Learning. MLSys 2022 - [i12]Sami Alabed, Dominik Grewe, Juliana Franco, Bart Chrzaszcz, Tom Natan, Tamara Norman, Norman A. Rink, Dimitrios Vytiniotis, Michael Schaarschmidt:
Automatic Discovery of Composite SPMD Partitioning Strategies in PartIR. CoRR abs/2210.06352 (2022) - [i11]Amir Shaikhha, Mathieu Huot, Shabnam Ghasemirad
, Andrew W. Fitzgibbon, Simon Peyton Jones, Dimitrios Vytiniotis:
Efficient and Sound Differentiable Programming in a Functional Array-Processing Language. CoRR abs/2212.10307 (2022) - 2021
- [j12]Adam Paszke, Daniel D. Johnson, David Duvenaud, Dimitrios Vytiniotis, Alexey Radul, Matthew J. Johnson, Jonathan Ragan-Kelley, Dougal Maclaurin:
Getting to the point: index sets and parallelism-preserving autodiff for pointful array programming. Proc. ACM Program. Lang. 5(ICFP): 1-29 (2021) - [c39]Mateusz Malinowski, Dimitrios Vytiniotis, Grzegorz Swirszcz, Viorica Patraucean, João Carreira:
Gradient Forward-Propagation for Large-Scale Temporal Video Modelling. CVPR 2021: 9249-9259 - [i10]Adam Paszke, Daniel D. Johnson, David Duvenaud, Dimitrios Vytiniotis, Alexey Radul, Matthew J. Johnson, Jonathan Ragan-Kelley, Dougal Maclaurin:
Getting to the Point. Index Sets and Parallelism-Preserving Autodiff for Pointful Array Programming. CoRR abs/2104.05372 (2021) - [i9]Mateusz Malinowski, Dimitrios Vytiniotis, Grzegorz Swirszcz, Viorica Patraucean, João Carreira:
Gradient Forward-Propagation for Large-Scale Temporal Video Modelling. CoRR abs/2106.08318 (2021) - [i8]Ningning Xie, Tamara Norman, Dominik Grewe, Dimitrios Vytiniotis:
Synthesizing Optimal Parallelism Placement and Reduction Strategies on Hierarchical Systems for Deep Learning. CoRR abs/2110.10548 (2021) - [i7]Norman A. Rink, Adam Paszke, Dimitrios Vytiniotis, Georg Stefan Schmid:
Memory-efficient array redistribution through portable collective communication. CoRR abs/2112.01075 (2021) - [i6]Michael Schaarschmidt, Dominik Grewe, Dimitrios Vytiniotis, Adam Paszke, Georg Stefan Schmid, Tamara Norman, James Molloy, Jonathan Godwin, Norman Alexander Rink, Vinod Nair, Dan Belov:
Automap: Towards Ergonomic Automated Parallelism for ML Models. CoRR abs/2112.02958 (2021) - 2020
- [j11]Alejandro Serrano, Jurriaan Hage, Simon Peyton Jones, Dimitrios Vytiniotis:
A quick look at impredicativity. Proc. ACM Program. Lang. 4(ICFP): 89:1-89:29 (2020) - [c38]Dimitrios Vytiniotis:
Declarative abstractions for tensor program partitioning. PPDP 2020: 3:1
2010 – 2019
- 2019
- [j10]Amir Shaikhha, Andrew W. Fitzgibbon, Dimitrios Vytiniotis, Simon Peyton Jones:
Efficient differentiable programming in a functional array-processing language. Proc. ACM Program. Lang. 3(ICFP): 97:1-97:30 (2019) - 2018
- [c37]Alejandro Serrano, Jurriaan Hage, Dimitrios Vytiniotis, Simon Peyton Jones:
Guarded impredicative polymorphism. PLDI 2018: 783-796 - [i5]Amir Shaikhha, Andrew W. Fitzgibbon, Dimitrios Vytiniotis, Simon Peyton Jones, Christoph Koch:
Efficient Differentiable Programming in a Functional Array-Processing Language. CoRR abs/1806.02136 (2018) - 2017
- [j9]Ilya Sergey
Modular, higher order cardinality analysis in theory and practice. J. Funct. Program. 27: e11 (2017) - [j8]Matthew J. Parkinson, Dimitrios Vytiniotis, Kapil Vaswani, Manuel Costa, Pantazis Deligiannis
Project snowflake: non-blocking safe manual memory management in .NET. Proc. ACM Program. Lang. 1(OOPSLA): 95:1-95:25 (2017) - [j7]Danfeng Zhang
SHErrLoc: A Static Holistic Error Locator. ACM Trans. Program. Lang. Syst. 39(4): 18:1-18:47 (2017) - [c36]Amir Shaikhha, Andrew W. Fitzgibbon, Simon Peyton Jones, Dimitrios Vytiniotis:
Destination-passing style for efficient memory management. FHPC@ICFP 2017: 12-23 - [c35]Piyus Kedia, Manuel Costa, Matthew J. Parkinson, Kapil Vaswani, Dimitrios Vytiniotis, Aaron Blankstein:
Simple, fast, and safe manual memory management. PLDI 2017: 233-247 - [i4]Alex Gaunt, Matthew Johnson, Maik Riechert, Daniel Tarlow, Ryota Tomioka, Dimitrios Vytiniotis, Sam Webster:
AMPNet: Asynchronous Model-Parallel Training for Dynamic Neural Networks. CoRR abs/1705.09786 (2017) - 2016
- [j6]Catalin Hritcu, Leonidas Lampropoulos, Antal Spector-Zabusky, Arthur Azevedo de Amorim, Maxime Dénès, John Hughes, Benjamin C. Pierce, Dimitrios Vytiniotis:
Testing noninterference, quickly. J. Funct. Program. 26: e4 (2016) - [c34]Simon Peyton Jones, Stephanie Weirich
A Reflection on Types. A List of Successes That Can Change the World 2016: 292-317 - [c33]Osbert Bastani, Yani Ioannou, Leonidas Lampropoulos, Dimitrios Vytiniotis, Aditya V. Nori, Antonio Criminisi:
Measuring Neural Net Robustness with Constraints. NIPS 2016: 2613-2621 - [i3]Osbert Bastani, Yani Ioannou
Measuring Neural Net Robustness with Constraints. CoRR abs/1605.07262 (2016) - 2015
- [c32]Gordon Stewart, Mahanth Gowda, Geoffrey Mainland
Ziria: A DSL for Wireless Systems Programming. ASPLOS 2015: 415-428 - [c31]Ionel Gog, Jana Giceva, Malte Schwarzkopf, Kapil Vaswani, Dimitrios Vytiniotis, Ganesan Ramalingam, Manuel Costa, Derek Gordon Murray, Steven Hand, Michael Isard:
Broom: Sweeping Out Garbage Collection from Big Data Systems. HotOS 2015 - [c30]Pablo Buiras, Dimitrios Vytiniotis, Alejandro Russo
HLIO: mixing static and dynamic typing for information-flow control in Haskell. ICFP 2015: 289-301 - [c29]Georgios Karachalias, Tom Schrijvers
GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness. ICFP 2015: 424-436 - [c28]Gordon Stewart, Mahanth Gowda, Geoffrey Mainland, Bozidar Radunovic, Dimitrios Vytiniotis:
Demo: Implementation of Real-time WiFi Receiver in Ziria, Language for Rapid Prototyping of Wireless PHY. MobiCom 2015: 210-211 - [c27]Danfeng Zhang
Diagnosing type errors with class. PLDI 2015: 12-21 - 2014
- [c26]Dimitrios Vytiniotis:
Ziria: wireless programming for hardware dummies. FHPC@ICFP 2014: 1 - [c25]Niki Vazou
Refinement types for Haskell. ICFP 2014: 269-282 - [c24]Mahanth Gowda, Gordon Stewart, Geoffrey Mainland
Poster: Ziria: language for rapid prototyping of wireless PHY. MobiCom 2014: 359-362 - [c23]Marcelo Sousa, Isil Dillig, Dimitrios Vytiniotis, Thomas Dillig, Christos Gkantsidis:
Consolidation of queries with user-defined functions. PLDI 2014: 554-564 - [c22]Ilya Sergey
Modular, higher-order cardinality analysis in theory and practice. POPL 2014: 335-348 - [c21]Richard A. Eisenberg
Closed type families with overlapping equations. POPL 2014: 671-684 - [c20]Gordon Stewart, Mahanth Gowda, Geoffrey Mainland
Demo: 802.11 a/g PHY implementation in ziria, domain-specific language for wireless programming. SRIF@SIGCOMM 2014: 27-30 - [c19]Gordon Stewart, Mahanth Gowda, Geoffrey Mainland
Ziria: language for rapid prototyping of wireless PHY. SIGCOMM 2014: 357-358 - [i2]Catalin Hritcu, Leonidas Lampropoulos, Antal Spector-Zabusky, Arthur Azevedo de Amorim, Maxime Dénès, John Hughes, Benjamin C. Pierce, Dimitrios Vytiniotis:
Testing Noninterference, Quickly. CoRR abs/1409.0393 (2014) - [i1]James Cheney, Torsten Grust, Dimitrios Vytiniotis:
Programming Languages for Big Data (PlanBig) (Dagstuhl Seminar 14511). Dagstuhl Reports 4(12): 48-67 (2014) - 2013
- [c18]Catalin Hritcu, John Hughes, Benjamin C. Pierce, Antal Spector-Zabusky, Dimitrios Vytiniotis, Arthur Azevedo de Amorim, Leonidas Lampropoulos:
Testing noninterference, quickly. ICFP 2013: 455-468 - [c17]Christos Gkantsidis, Dimitrios Vytiniotis, Orion Hodson, Dushyanth Narayanan, Florin Dinu, Antony I. T. Rowstron:
Rhea: Automatic Filtering for Unstructured Cloud Storage. NSDI 2013: 343-355 - [c16]Dimitrios Vytiniotis, Simon L. Peyton Jones, Koen Claessen, Dan Rosén:
HALO: haskell to logic through denotational semantics. POPL 2013: 431-442 - [c15]Dimitrios Vytiniotis, Simon L. Peyton Jones:
Evidence Normalization in System FC (Invited Talk). RTA 2013: 20-38 - 2012
- [j5]Andrew J. Kennedy, Dimitrios Vytiniotis:
Every bit counts: The binary representation of typed data and programs. J. Funct. Program. 22(4-5): 529-573 (2012) - [c14]Dimitrios Vytiniotis, Simon L. Peyton Jones, José Pedro Magalhães
Equality proofs and deferred type errors: a compiler pearl. ICFP 2012: 341-352 - [c13]Dimitrios Vytiniotis, Thierry Coquand, David Wahlstedt:
Stop When You Are Almost-Full - Adventures in Constructive Termination. ITP 2012: 250-265 - [c12]Brent A. Yorgey, Stephanie Weirich
Giving Haskell a promotion. TLDI 2012: 53-66 - 2011
- [j4]Dimitrios Vytiniotis, Simon L. Peyton Jones, Tom Schrijvers
OutsideIn(X) Modular type inference with local assumptions. J. Funct. Program. 21(4-5): 333-412 (2011) - [c11]Maximilian C. Bolingbroke, Simon L. Peyton Jones, Dimitrios Vytiniotis:
Termination combinators forever. Haskell 2011: 23-34 - [c10]Stephanie Weirich
Generative type abstraction and type-level computation. POPL 2011: 227-240 - 2010
- [j3]Dimitrios Vytiniotis, Stephanie Weirich
Parametricity, type equality, and higher-order polymorphism. J. Funct. Program. 20(2): 175-210 (2010) - [c9]Dimitrios Vytiniotis, Andrew J. Kennedy:
Functional pearl: every bit counts. ICFP 2010: 15-26 - [c8]Dimitrios Vytiniotis, Simon L. Peyton Jones, Tom Schrijvers
Let should not be generalized. TLDI 2010: 39-50
2000 – 2009
- 2009
- [c7]Tom Schrijvers
Complete and decidable type inference for GADTs. ICFP 2009: 341-352 - 2008
- [c6]Dimitrios Vytiniotis, Stephanie Weirich
FPH: first-class polymorphism for Haskell. ICFP 2008: 295-306 - 2007
- [j2]Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich
Practical type inference for arbitrary-rank types. J. Funct. Program. 17(1): 1-82 (2007) - [c5]Dimitrios Vytiniotis, Stephanie Weirich
Free Theorems and Runtime Type Representations. MFPS 2007: 357-373 - 2006
- [j1]J. Nathan Foster, Dimitrios Vytiniotis:
A Theory of Featherweight Java in Isabelle/HOL. Arch. Formal Proofs 2006 (2006) - [c4]Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich
Simple unification-based type inference for GADTs. ICFP 2006: 50-61 - [c3]Dimitrios Vytiniotis, Stephanie Weirich
Boxy types: inference for higher-rank types and impredicativity. ICFP 2006: 251-262 - 2005
- [c2]Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich:
An open and shut typecase. TLDI 2005: 13-24 - [c1]Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell
Mechanized Metatheory for the Masses: The PoplMark Challenge. TPHOLs 2005: 50-65
Coauthor Index
aka: Simon Peyton Jones
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: