default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Graf
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c31]André Heining, Stefan Esser, Stephanie Mrzyglod, Marwan Abdou Ahmed, Thomas Graf, Oliver Sawodny:
Intra-Cavity Control of an Adaptive Thin-Disk Laser with Multiple Pneumatically Actuated Deformable Mirrors. ACC 2024: 5061-5066- [c30]Maximilian Schrapel
, Thomas Graf, Domenico Mario Zappalà, Claudia Campolo, Antonella Molinaro, Alexey V. Vinel:
When the E-bike Takes Over: Speed Precision and Perception of Cruise Control for Cyclists. AutomotiveUI 2024: 272-282 - [c29]Melih Yazgan, Thomas Graf, Min Liu, Tobias Fleck, J. Marius Zöllner:
A Survey on Intermediate Fusion Methods for Collaborative Perception Categorized by Real World Challenges. IV 2024: 2226-2233 - [c28]Alex Huang Feng, Pierre François, Kensuke Fukuda, Wanting Du, Thomas Graf, Paolo Lucente, Stéphane Frénot:
Practical Anomaly Detection in Internet Services: An ISP centric approach. NOMS 2024: 1-4 - [i3]Melih Yazgan, Thomas Graf, Min Liu, Tobias Fleck, J. Marius Zoellner:
A Survey on Intermediate Fusion Methods for Collaborative Perception Categorized by Real World Challenges. CoRR abs/2404.16139 (2024) - 2023
- [j8]Antonios Klonizakis, Christoforos Nikolaou, Thomas Graf:
SEGCOND predicts putative transcriptional condensate-associated genomic regions by integrating multi-omics data. Bioinform. 39(1) (2023) - [c27]Alex Huang Feng, Pierre François, Stéphane Frénot, Thomas Graf, Wanting Du, Paolo Lucente:
Daisy: Practical Anomaly Detection in large BGP/MPLS and BGP/SRv6 VPN Networks. ANRW 2023: 8-14 - [i2]Thomas Graf, Benoit Claise, Pierre François:
Export of Segment Routing over IPv6 Information in IP Flow Information Export (IPFIX). RFC 9487: 1-23 (2023) - 2021
- [i1]Thomas Graf:
Export of MPLS Segment Routing Label Type Information in IP Flow Information Export (IPFIX). RFC 9160: 1-5 (2021) - 2020
- [c26]Thomas Graf:
Monotonicity in Syntax. TLLM 2020: 35-53
2010 – 2019
- 2019
- [j7]Thomas Graf:
Monotonicity as an effective theory of morphosyntactic variation. J. Lang. Model. 7(2): 3-47 (2019) - [c25]Aniello De Santo, Thomas Graf:
Structure Sensitive Tier Projection: Applications and Formal Properties. FG 2019: 35-50 - [c24]Kevin Schmidt, Thomas Graf, Marwan Abdou Ahmed, Oliver Sawodny:
Energy-optimal disturbance feedforward control for constrained deformable mirrors with thermoelastic actuation. SMC 2019: 107-112 - 2018
- [j6]Kevin Schmidt, Philipp Wittmuess, Stefan Piehler, Marwan Abdou Ahmed, Thomas Graf, Oliver Sawodny:
Modellierung optisch adressierter Spiegel für adaptive Hochleistungslaser. Autom. 66(7): 506-520 (2018) - 2017
- [j5]Thomas Graf, James Monette, Chong Zhang:
Relative clauses as a benchmark for Minimalist parsing. J. Lang. Model. 5(1): 57-106 (2017) - [c23]Thomas Graf:
Graph Transductions and Typological Gaps in Morphological Paradigms. MOL 2017: 114-126 - 2016
- [c22]Thomas Graf, Alëna Aksënova, Aniello De Santo:
A Single Movement Normal Form for Minimalist Grammars. FG 2016: 200-215 - [c21]Alëna Aksënova, Thomas Graf, Sedigheh Moradi:
Morphotactics as Tier-Based Strictly Local Dependencies. SIGMORPHON 2016: 121-130 - [c20]Aniello De Santo, Alëna Aksënova, Thomas Graf:
An Alternate View on Strong Lexicalization in TAG. TAG 2016: 93-102 - 2015
- [c19]Thomas Graf, Brigitta Fodor, James Monette, Gianpaul Rachiele, Aunika Warren, Chong Zhang:
A Refined Notion of Memory Usage for Minimalist Parsing. MOL 2015: 1-14 - 2014
- [c18]Thomas Graf, Bradley Marcinek:
Evaluating Evaluation Metrics for Minimalist Parsing. CMCL@ACL 2014: 28-36 - [c17]Thomas Graf:
Models of Adjunction in Minimalist Grammars. FG 2014: 52-68 - [c16]Thomas Graf:
Late Merge as Lowering Movement in Minimalist Grammars. LACL 2014: 107-121 - 2013
- [b1]Thomas Graf:
Local and Transderivational Constraints in Syntax and Semantics. University of California, Los Angeles, USA, 2013 - [j4]Thomas H. Payne, David W. Bates, Eta S. Berner, Elmer V. Bernstam, H. Dominic Covvey, Mark E. Frisse, Thomas Graf, Robert A. Greenes, Edward P. Hoffer, Gilad J. Kuperman, Harold P. Lehmann, Louise Liang, Blackford Middleton, Gilbert S. Omenn, Judy G. Ozbolt:
Healthcare information technology and economics. J. Am. Medical Informatics Assoc. 20(2): 212-217 (2013) - [c15]Thomas Graf, Sebastian Zickau, Axel Küpper:
Enabling Location-Based Services on Stationary Devices Using Smartphone Capabilities. MobiWIS 2013: 49-63 - 2012
- [c14]Oliver Hohlfeld, Thomas Graf, Florin Ciucu:
Longtime behavior of harvesting spam bots. Internet Measurement Conference 2012: 453-460 - [c13]Thomas Graf:
Movement-Generalized Minimalist Grammars. LACL 2012: 58-73 - [c12]Thomas Graf:
Tree Adjunction as Minimalist Lowering. TAG 2012: 19-27 - [c11]Thomas Graf, Natasha Abner:
Is Syntactic Binding Rational? TAG 2012: 189-197 - 2011
- [c10]Thomas Graf:
Locality and the Complexity of Minimalist Derivation Tree Languages. FG 2011: 208-227 - [c9]Thomas Graf:
Closure Properties of Minimalist Derivation Tree Languages. LACL 2011: 96-111 - 2010
- [c8]Thomas Graf:
Reference-Set Constraints as Linear Tree Transductions via Controlled Optimality Systems. FG 2010: 97-113
2000 – 2009
- 2009
- [c7]Thomas Graf:
Formal Parameters of Phonology - From Government Phonology to SPE. ESSLLI Student Sessions 2009: 72-86 - [c6]Thomas Graf:
Some Interdefinability Results for Syntactic Constraint Classes. MOL 2009: 72-87
1990 – 1999
- 1998
- [c5]Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan:
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries. COCOON 1998: 35-44 - 1997
- [j3]Thomas Graf, V. Kamakoti:
Sparse Dominance Queries for Many Points in Optimal Time and Space. Inf. Process. Lett. 64(6): 287-291 (1997) - [c4]Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan:
An optimal parallel algorithm for the all-nearest-foreign-neighbors problem in arbitrary dimensions. HiPC 1997: 132-136 - 1994
- [j2]Werner Fuchs, Thomas Graf, Thomas Kirsche:
Darstellung, Konvertierung und Farbreduktion von Rasterbildern auf Basis eines universellen Zwischenformates. Informationstechnik Tech. Inform. 36(3): 30-37 (1994) - 1992
- [j1]Pascal Van Hentenryck, Thomas Graf:
Standard Forms for Rational Linear Arithmetic in Constraint Logic Programming. Ann. Math. Artif. Intell. 5(2-4): 303-319 (1992)
1980 – 1989
- 1989
- [c3]Thomas Graf, Pascal Van Hentenryck, Claudine Pradelles, Laurent Zimmer:
Simulation of Hybrid Circuits in Constraint Logic Programming. IJCAI 1989: 72-77 - 1988
- [c2]Mehmet Dincbas, Pascal Van Hentenryck, Helmut Simonis, Abderrahmane Aggoun, Thomas Graf, Françoise Berthier:
The Constraint Logic Programming Language CHIP. FGCS 1988: 693-702 - [c1]Mehmet Dincbas, Pascal Van Hentenryck, Helmut Simonis, Abderrahmane Aggoun, Thomas Graf:
Applications of CHIP to Industrial and Engineering Problems. IEA/AIE (Vol. 2) 1988: 885-892
Coauthor Index
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-04 21:01 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:
