10,501 results
Search Results
152. Fixed-parameter algorithms for graph constraint logic
153. Parameterized complexity of perfectly matched sets
154. Restrained domination and its variants in extended supergrid graphs
155. On the average complexity of partial derivative transducers
156. Upper and lower degree-constrained graph orientation with minimum penalty.
157. Identity-based encryption with security against the KGC: A formal model and its instantiations.
158. Kindergarden quantum mechanics graduates...or how I learned to stop gluing LEGO together and love the ZX-calculus.
159. Adaptive learning of compressible strings.
160. On the effects of hierarchical self-assembly for reducing program-size complexity.
161. Automata for solid codes.
162. The higher-order meet-in-the-middle attack and its application to the Camellia block cipher
163. Colouring of graphs with Ramsey-type forbidden subgraphs
164. A single exponential-time FPT algorithm for cactus contraction
165. Location functions for self-stabilizing byzantine tolerant swarms
166. Fixed parameterized algorithms for generalized feedback vertex set problems
167. A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
168. Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
169. Dichotomy result on 3-regular bipartite non-negative functions
170. Tight bounds on sensitivity and block sensitivity of some classes of transitive functions
171. Improved characters distance sampling for online and offline text searching
172. Trajectory optimization of laser-charged UAV to minimize the average age of information for wireless rechargeable sensor network
173. Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees.
174. Copy complexity of Horn formulas with respect to unit read-once resolution.
175. Efficient computation of the oriented chromatic number of recursively defined digraphs.
176. The Steiner k-eccentricity on trees.
177. The g-component connectivity of graphs.
178. Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects.
179. Approximation algorithms for fuzzy C-means problem based on seeding method.
180. A Wiener-type attack on an RSA-like cryptosystem constructed from cubic Pell equations.
181. Rewriting theory for the life sciences: A unifying theory of CTMC semantics.
182. On the parametrized complexity of read-once refutations in UTVPI+ constraint systems.
183. Evacuating from ℓp unit disks in the wireless model
184. Multi-objective evolutionary algorithms are generally good: Maximizing monotone submodular functions over sequences
185. Reconfiguring (non-spanning) arborescences
186. Distributed transformations of Hamiltonian shapes based on line moves
187. Improved approximation algorithms for solving the squared metric k-facility location problem
188. Compact suffix automata representations for searching long patterns
189. On Billaud words and their companions
190. Project games
191. On computing the Hamiltonian index of graphs
192. Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane
193. A fault diagnosis method to defend scapegoating attack in network tomography
194. Theoretical design of decentralized auction framework under mobile crowdsourcing environment
195. Few induced disjoint paths for H-free graphs
196. Deciding path size of nondeterministic (and input-driven) pushdown automata
197. Stand up indulgent gathering
198. A game-theoretic perspective of deep neural networks
199. Enumeration approach to computing chemical equilibria
200. MR4UM: A framework for adding fault tolerance to UML state diagrams
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.