Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 95 matches
- 2023
- Julia Isabel Hartmann, Michael Olbrich, Marcus Hamann, Christoph Ament:
Simulation of Particle Motion on Rotating Cone Feeder for a Multihead Weigher Based on Dynamic Friction Modeling. AIM 2023: 138-143 - Romeo Kienzler, Johannes Schmude, Naomi Simumba, Benedikt Blumenstiel, Marcus Freitag, Daiki Kimura, Zoltan Arnold Nagy, Michael Behrendt, Hendrik F. Hamann, S. Karthik Mukkavilli, Daniel Salles Civitarese:
TensorBank: Tensor Lakehouse for Foundation Model Training. IEEE Big Data 2023: 3350-3354 - Romeo Kienzler, Benedikt Blumenstiel, Zoltan Arnold Nagy, S. Karthik Mukkavilli, Johannes Schmude, Marcus Freitag, Michael Behrendt, Daniel Salles Civitarese, Naomi Simumba, Daiki Kimura, Hendrik F. Hamann:
TensorBank: Tensor Lakehouse for Foundation Model Training. CoRR abs/2309.02094 (2023) - 2022
- Lars Gottesbüren, Michael Hamann:
Deterministic Parallel Hypergraph Partitioning. Euro-Par 2022: 301-316 - Helena Barbas, Marcus Soll, Jakob Smedegaard Andersen, Esther Bender, Fabian Hamann, Michael Haustermann, Daniel Sitzmann:
The MINTFIT Computer Science Online Course. GeCon 2022: 1-6 - Ahsan Saeed, Dakshina Dasari, Dirk Ziegenbein, Varun Rajasekaran, Falk Rehm, Michael Pressler, Arne Hamann, Daniel Mueller-Gritschneder, Andreas Gerstlauer, Ulf Schlichtmann:
Memory Utilization-Based Dynamic Bandwidth Regulation for Temporal Isolation in Multi-Cores. RTAS 2022: 133-145 - Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
A Branch-And-Bound Algorithm for Cluster Editing. SEA 2022: 13:1-13:19 - Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation1. Massive Graph Analytics 2022: 333-376 - Eugenio Angriman, Alexander van der Grinten, Michael Hamann, Henning Meyerhenke, Manuel Penschuck:
Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit. Algorithms for Big Data 2022: 3-20 - Ulrik Brandes, Michael Hamann, Luise Häuser, Dorothea Wagner:
Skeleton-Based Clustering by Quasi-Threshold Editing. Algorithms for Big Data 2022: 134-151 - Eugenio Angriman, Alexander van der Grinten, Michael Hamann, Henning Meyerhenke, Manuel Penschuck:
Algorithms for Large-scale Network Analysis and the NetworKit Toolkit. CoRR abs/2209.13355 (2022) - 2021
- Michael Hamann:
Scalable Community Detection. Karlsruhe Institute of Technology, Germany, 2021 - Falk Rehm, Dakshina Dasari, Arne Hamann, Michael Pressler, Dirk Ziegenbein, Jörg Seitter, Ignacio Sañudo, Nicola Capodieci, Paolo Burgio, Marko Bertogna:
Performance modeling of heterogeneous HW platforms. Microprocess. Microsystems 87: 104336 (2021) - Valeria Saggio, Beate E. Asenbeck, Arne Hamann, Teodor Strömberg, Peter Schiansky, Vedran Dunjko, Nicolai Friis, Nicholas C. Harris, Michael Hochberg, Dirk R. Englund, Sabine Wölk, Hans J. Briegel, Philip Walther:
Experimental quantum speed-up in reinforcement learning agents. Nat. 591(7849): 229-233 (2021) - Ngoc Thinh Nguyen, Lars Schilling, Michael Sebastian Angern, Heiko Hamann, Floris Ernst, Georg Schildbach:
B-spline path planner for safe navigation of mobile robots. IROS 2021: 339-345 - Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm. IPEC 2021: 27:1-27:3 - Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, Marcus Wilhelm:
PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm. IPEC 2021: 31:1-31:4 - Dakshina Dasari, Arne Hamann, Holger Broede, Michael Pressler, Dirk Ziegenbein:
Brief Industry Paper: Dissecting the QNX Adaptive Partitioning Scheduler. RTAS 2021: 477-480 - Michael J. A. Girard, Satish Kumar Panda, Tin Aung Tun, Elisabeth A. Wibroe, Raymond P. Najjar, Aung Tin, Alexandre H. Thiéry, Steffen Hamann, Clare Fraser, Dan Milea:
3D Structural Analysis of the Optic Nerve Head to Robustly Discriminate Between Papilledema and Optic Disc Drusen. CoRR abs/2112.09970 (2021) - Lars Gottesbüren, Michael Hamann:
Deterministic Parallel Hypergraph Partitioning. CoRR abs/2112.12704 (2021) - 2020
- Samuel A. Surulere, Michael Y. Shatalov, Andrew C. Mkolesia, Julius Osato Ehigie:
The integral-differential and integral approach for the estimation of the classical Lennard-Jones and Biswas-Hamann potentials. Int. J. Math. Model. Numer. Optimisation 10(3): 239-254 (2020) - Dakshina Dasari, Michael Pressler, Arne Hamann, Dirk Ziegenbein, Paul Austin:
Applying Reservation-based Scheduling to a μC-based Hypervisor: An industrial case study. DATE 2020: 987-990 - Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, Dorothea Wagner, Sven Zühlsdorf:
Engineering Exact Quasi-Threshold Editing. SEA 2020: 10:1-10:14 - Lars Gottesbüren, Michael Hamann, Sebastian Schlag, Dorothea Wagner:
Advanced Flow-Based Multilevel Hypergraph Partitioning. SEA 2020: 11:1-11:15 - Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation. CoRR abs/2003.00736 (2020) - Lars Gottesbüren, Michael Hamann, Sebastian Schlag, Dorothea Wagner:
Advanced Flow-Based Multilevel Hypergraph Partitioning. CoRR abs/2003.12110 (2020) - Lars Gottesbüren, Michael Hamann, Philipp Schoch, Ben Strasser, Dorothea Wagner, Sven Zühlsdorf:
Engineering Exact Quasi-Threshold Editing. CoRR abs/2003.14317 (2020) - 2019
- Lars Gottesbüren, Michael Hamann, Tim Niklas Uhl, Dorothea Wagner:
Faster and Better Nested Dissection Orders for Customizable Contraction Hierarchies. Algorithms 12(9): 196 (2019) - Michael Hamann, Ben Strasser:
Correspondence between Multilevel Graph Partitions and Tree Decompositions. Algorithms 12(9): 198 (2019) - Gregor Betz, Michael Hamann, Tamara Mchedlidze, Sophie von Schmettow:
Applying argumentation to structure and visualize multi-dimensional opinion spaces. Argument Comput. 10(1): 23-40 (2019)
skipping 65 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-06-16 06:41 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint