# Search results for: Siddhartha Sen

International Journal of Robust and Nonlinear Control > 28 > 18 > 6038 - 6052

Journal for ImmunoTherapy of Cancer > 2018 > 6 > 1 > 1-10

_{mem}) has been shown to have superior efficacy compared to traditional ACT with effector CD8+ T cells (T

_{eff}). T

_{eff}and T

_{mem}have complementary physiological advantages for immunotherapy, but previous publications have not examined...

IEEE Transactions on Instrumentation and Measurement > 2018 > 67 > 1 > 196 - 203

Journal of High Energy Physics > 2017 > 2017 > 10 > 1-12

IET Circuits, Devices & Systems > 2017 > 11 > 5 > 496 - 503

Electrochemistry Communications > 2017 > 76 > C > 38-41

Circuits, Systems, and Signal Processing > 2017 > 36 > 9 > 3457-3476

IEEE Transactions on Circuits and Systems I: Regular Papers > 2016 > 63 > 8 > 1142 - 1151

Automatica > 2016 > 67 > C > 107-113

*rank-pairing heap*, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps. Unlike all other heap implementations that match the bounds of Fibonacci heaps, our structure needs only one cut and no other structural changes per key decrease; the trees representing the heap can evolve to have arbitrary...

Lecture Notes in Computer Science > Distributed Computing > Graph Algorithms and Routing (Session 3B) > 392-406

Lecture Notes in Computer Science > Distributed Computing > Brief Announcements II (Session 1f) > 205-207

*concurrent multi-commodity flow problem*, we are given a capacitated network

*G*= (

*V*,

*E*) of switches

*V*connected by links

*E*, and a set of commodities ${\cal K} = \{(s_i,t_i,d_i)\}$ . The objective is to maximize the minimum fraction

*λ*of any demand

*d*

_{ i }that is routed from source

*s*

_{ i }to target

*t*

_{ }...

*rank-balanced tree*, a relaxation of AVL trees. Rank-balanced...

^{ + }tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalanced tree. Yet such databases perform well in practice. Avoidance of rebalancing on deletion has been justified empirically and by average-case analysis, but to our knowledge no worst-case analysis has been done. We do such...

Circuits, Systems, and Signal Processing > 2016 > 35 > 6 > 2109-2124