Search Results - "Kubicka, Ewa M."

Convalescent Plasma for Preventing Critical Illness in COVID-19: a Phase 2 Trial and Immune Profile by Sturek, Jeffrey M, Thomas, Tania A, Gorham, James D, Sheppard, Chelsea A, Raymond, Allison H, Petros De Guex, Kristen, Harrington, William B, Barros, Andrew J, Madden, Gregory R, Alkabab, Yosra M, Lu, David Y, Liu, Qin, Poulter, Melinda D, Mathers, Amy J, Thakur, Archana, Schalk, Dana L, Kubicka, Ewa M, Lum, Lawrence G, Heysell, Scott K

“…The COVID-19 pandemic caused by the severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) is an unprecedented event requiring frequent adaptation to…”
Get full text

Tail probabilities of a random walk on an interval by Kubicka, Ewa M., Kubicki, Grzegorz, Kuchta, Małgorzata, Morayne, Michał

“…If a random walk starts at the center of a symmetric discrete interval and we condition on being in I until a given time t, then for any fixed , the…”
Get full text

Maximizing survival time in a random walk on an interval by Kubicka, Ewa M., Kubicki, Grzegorz, Kuchta, Małgorzata, Morayne, Michał

“…A gambler buys N tokens that enable him to play N rounds of the following game. A symmetric random walk on a discrete interval { − r, ..., r} starts from the…”
Get full text

An efficient algorithm for stopping on a sink in a directed graph by Goddard, Wayne, Kubicka, Ewa M., Kubicki, Grzegorz

“…Vertices of an unknown directed graph of order n are revealed one by one in some random permutation. At each point, we know the subgraph induced by the…”
Get full text

Total Colorings of Graphs with Minimum Sum of Colors by Kubicka, Ewa M., Kubicki, Grzegorz M., Leidner, Maxfield

“…The total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We…”
Get full text

Secretary problem with hidden information; searching for a high merit candidate by Kubicka, Ewa M., Kubicki, Grzegorz, Kuchta, Małgorzata, Morayne, Michał

“…Real numbers from the interval [0,1] are randomly selected with uniform distribution. There are n of them and they measure shortcomings of the candidates from…”
Get full text

An optimal algorithm for stopping on the element closest to the center of an interval by Kubicka, Ewa M., Kubicki, Grzegorz, Kuchta, Małgorzata, Sulkowska, Małgorzata

“…•Version of the secretary problem with the goal to stop on the central element.•Recursive construction of an optimal stopping rule.•Optimal stopping algorithm…”
Get full text

Chromatic Sums for Colorings Avoiding Monochromatic Subgraphs by Kubicka, Ewa, Kubicki, Grzegorz, McKeon, Kathleen A.

“…Given graphs G and H, a vertex coloring c : V (G) →ℕ is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic…”
Get full text

An Optimal Algorithm for Stopping on the Element Closest to the Center of an Interval by Kubicka, Ewa M, Kubicki, Grzegorz, Kuchta, Małgorzata, Sulkowska, Małgorzata

“…Real numbers from the interval [0, 1] are randomly selected with uniform distribution. There are $n$ of them and they are revealed one by one. However, we do…”
Get full text