706 results
Search Results
2. Investigation of E-voting system using face recognition using convolutional neural network (CNN).
3. On priority-proportional payments in financial networks
4. Online hitting of unit balls and hypercubes in [formula omitted] using points from [formula omitted]
5. State-based opacity of labeled real-time automata
6. Self-stabilizing 2-minimal dominating set algorithms based on loop composition
7. Two-dimensional drift analysis: Optimizing two functions simultaneously can be hard
8. Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model
9. A graph searching game for block treedepth and a cubic kernel by vertex cover
10. Deterministic metric 1-median selection with very few queries
11. Cutting Barnette graphs perfectly is hard
12. On the complexity of distance-d independent set reconfiguration
13. Truncating abstraction of bit-vector operations for BDD-based SMT solvers
14. The longest almost increasing subsequence problem with sliding windows
15. Classifying subset feedback vertex set for H-free graphs
16. The equivalence between Galois and Fibonacci NFSRs
17. Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes
18. Deciding atomicity of subword-closed languages
19. Overlapping edge unfoldings for convex regular-faced polyhedra
20. New algorithms for fair k-center problem with outliers and capacity constraints
21. On the power of threshold-based algorithms for detecting cycles in the CONGEST model
22. Two-stage BP maximization under p-matroid constraint
23. Reliability assessment of the divide-and-swap cube in terms of generalized connectivity.
24. Approximate distance oracles with improved stretch for sparse graphs.
25. Optimal self-stabilizing mobile byzantine-tolerant regular register with bounded timestamps.
26. Decision on block size in blockchain systems by evolutionary equilibrium analysis.
27. An LP-based approximation algorithm for the generalized traveling salesman path problem.
28. A decidable theory involving addition of differentiable real functions.
29. Upper and lower bounds on approximating weighted mixed domination.
30. Implementations and the independent set polynomial below the Shearer threshold.
31. On the binary digits of n and n2.
32. Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems.
33. The submodularity of two-stage stochastic maximum-weight independent set problems.
34. Remarks on context-free grammars with subregular control languages.
35. Snapshot disjointness in temporal graphs.
36. Computational task offloading algorithm based on deep reinforcement learning and multi-task dependency
37. Ordered scheduling in control-flow distributed transactional memory
38. Approximation algorithms for drone delivery scheduling with a fixed number of drones
39. Refined computational complexities of Hospitals/Residents problem with regional caps
40. The existence and efficiency of PMMS allocations
41. New approximation algorithms for RNA secondary structures prediction problems by local search
42. Max-min greedy matching problem: Hardness for the adversary and fractional variant
43. Routing schemes for hybrid communication networks
44. On geometric shape construction via growth operations
45. Partitioning subclasses of chordal graphs with few deletions
46. On the probe problem for (r,ℓ)-well-coveredness: Algorithms and complexity.
47. Exact square coloring of certain classes of graphs: Complexity and algorithms.
48. Gaussian downlink user selection subject to access limit, power budget, and rate demands.
49. Complexity of paired domination in AT-free and planar graphs.
50. Adaptive influence maximization under fixed observation time-step.
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.