Search Results - "Bæk, Mathias"

Maximal unbordered factors of random strings by Cording, Patrick Hagge, Gagie, Travis, Knudsen, Mathias Bæk Tejs, Kociumaka, Tomasz

“…A border of a string is a non-empty prefix of the string that is also a suffix of the string, and a string is unbordered if it has no border other than itself…”
Get full text

Identification of the First Highly Subtype-Selective Inhibitor of Human GABA Transporter GAT3 by Damgaard, Maria, Al-Khawaja, Anas, Vogensen, Stine B, Jurik, Andreas, Sijm, Maarten, Lie, Maria E. K, Bæk, Mathias I, Rosenthal, Emil, Jensen, Anders A, Ecker, Gerhard F, Frølund, Bente, Wellendorph, Petrine, Clausen, Rasmus P

“…Screening a library of small-molecule compounds using a cell line expressing human GABA transporter 3 (hGAT3) in a [3H]­GABA uptake assay identified isatin…”
Get full text

5‑HT2A/5-HT2C Receptor Pharmacology and Intrinsic Clearance of N‑Benzylphenethylamines Modified at the Primary Site of Metabolism by Leth-Petersen, Sebastian, Petersen, Ida N, Jensen, Anders A, Bundgaard, Christoffer, Bæk, Mathias, Kehler, Jan, Kristensen, Jesper L

“…The toxic hallucinogen 25B-NBOMe is very rapidly degraded by human liver microsomes and has low oral bioavailability. Herein we report on the synthesis,…”
Get full text

Psychopharmacological treatment in patients planned for hip or knee replacement by Kornvig, Simon, Kehlet, Henrik, Jørgensen, Christoffer Calov, Fink‐Jensen, Anders, Videbech, Poul, Lindberg‐Larsen, Martin, Gromov, Kirill, Rasmussen, Mathias Bæk, Bieder, Manuel Josef, Varnum, Claus

“…Psychopharmacological treatment may be an independent risk factor for increased length of stay and readmission after hip and knee replacement. Thus, temporary…”
Get full text

Maximal Unbordered Factors of Random Strings by Cording, Patrick Hagge, Gagie, Travis, Knudsen, Mathias Bæk Tejs, Kociumaka, Tomasz

“…A border of a string is a non-empty prefix of the string that is also a suffix of the string, and a string is unbordered if it has no border other than itself…”
Get full text

Pronator teres syndrome is a rare but important cause of pain in the forearm by Rasmussen, Mathias Bæk, Deutch, Søren Rasmussen

“…Pronator teres syndrome is a rare but clinically important condition which can cause pain in the forearm. It is a com-pression neuropathy due to compression of…”
Get more information

5-HT 2A /5-HT 2C Receptor Pharmacology and Intrinsic Clearance of N-Benzylphenethylamines Modified at the Primary Site of Metabolism by Leth-Petersen, Sebastian, Petersen, Ida N, Jensen, Anders A, Bundgaard, Christoffer, Bæk, Mathias, Kehler, Jan, Kristensen, Jesper L

“…The toxic hallucinogen 25B-NBOMe is very rapidly degraded by human liver microsomes and has low oral bioavailability. Herein we report on the synthesis,…”
Get full text

Linear Hashing is Awesome by Knudsen, Mathias Bæk Tejs

“…We consider the hash function $h(x) = ((ax+b) \bmod p) \bmod n$ where $a,b$ are chosen uniformly at random from $\{0,1,\ldots,p-1\}$. We prove that when we use…”
Get full text

Additive Spanners and Distance Oracles in Quadratic Time by Knudsen, Mathias Bæk Tejs

“…Let $G$ be an unweighted, undirected graph. An additive $k$-spanner of $G$ is a subgraph $H$ that approximates all distances between pairs of nodes up to an…”
Get full text

Additive Spanners: A Simple Construction by Knudsen, Mathias Bæk Tejs

“…We consider additive spanners of unweighted undirected graphs. Let $G$ be a graph and $H$ a subgraph of $G$. The most na\"ive way to construct an additive…”
Get full text

The Entropy of Backwards Analysis by Knudsen, Mathias Bæk Tejs, Thorup, Mikkel

“…Backwards analysis, first popularized by Seidel, is often the simplest most elegant way of analyzing a randomized algorithm. It applies to incremental…”
Get full text

Power of $d$ Choices with Simple Tabulation by Aamand, Anders, Knudsen, Mathias Bæk Tejs, Thorup, Mikkel

“…Suppose that we are to place $m$ balls into $n$ bins sequentially using the $d$-choice paradigm: For each ball we are given a choice of $d$ bins, according to…”
Get full text

Practical Hash Functions for Similarity Estimation and Dimensionality Reduction by Dahlgaard, Søren, Knudsen, Mathias Bæk Tejs, Thorup, Mikkel

“…Hashing is a basic tool for dimensionality reduction employed in several aspects of machine learning. However, the perfomance analysis is often carried out…”
Get full text

New Subquadratic Approximation Algorithms for the Girth by Dahlgaard, Søren, Knudsen, Mathias Bæk Tejs, Stöckel, Morten

“…We consider the problem of approximating the girth, $g$, of an unweighted and undirected graph $G=(V,E)$ with $n$ nodes and $m$ edges. A seminal result of Itai…”
Get full text

Finding Even Cycles Faster via Capped k-Walks by Dahlgaard, Søren, Knudsen, Mathias Bæk Tejs, Stöckel, Morten

“…In this paper, we consider the problem of finding a cycle of length $2k$ (a $C_{2k}$) in an undirected graph $G$ with $n$ nodes and $m$ edges for constant…”
Get full text

Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence by Knudsen, Mathias Bæk Tejs, Stöckel, Morten

“…Randomized algorithms and data structures are often analyzed under the assumption of access to a perfect source of randomness. The most fundamental metric used…”
Get full text

Sublinear Distance Labeling by Alstrup, Stephen, Dahlgaard, Søren, Knudsen, Mathias Bæk Tejs, Porat, Ely

“…A distance labeling scheme labels the $n$ nodes of a graph with binary strings such that, given the labels of any two nodes, one can determine the distance in…”
Get full text

Fast Similarity Sketching by Dahlgaard, Søren, Langhede, Mathias Bæk Tejs, Houen, Jakob Bæk Tejs, Thorup, Mikkel

“…We consider the $\textit{Similarity Sketching}$ problem: Given a universe $[u] = \{0,\ldots, u-1\}$ we want a random function $S$ mapping subsets $A\subseteq…”
Get full text

Optimal induced universal graphs and adjacency labeling for trees by Alstrup, Stephen, Dahlgaard, Søren, Knudsen, Mathias Bæk Tejs

“…We show that there exists a graph $G$ with $O(n)$ nodes, where any forest of $n$ nodes is a node-induced subgraph of $G$. Furthermore, for constant arboricity…”
Get full text

Hashing for statistics over k-partitions by Dahlgaard, Søren, Knudsen, Mathias Bæk Tejs, Rotenberg, Eva, Thorup, Mikkel

“…In this paper we analyze a hash function for $k$-partitioning a set into bins, obtaining strong concentration bounds for standard algorithms combining…”
Get full text