143 results on '"Viola, Alfredo"'
Search Results
2. Analysis of the Continued Logarithm Algorithm
3. Recurrence Function on Sturmian Words: A Probabilistic Study
4. Beating the Birthday Paradox in Dining Cryptographer Networks
5. Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields : (Extended Abstract)
6. Analysis of Quickfind with Small Subfiles
7. Analysis of Rabin's polynomial irreducibility test
8. The analysis of linear probing hashing with buckets : Extended abstract
9. The analysis of a hashing scheme by the diagonal poisson transform : Extended abstract
10. Helly-Type Theorems in Property Testing
11. Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles
12. Collision-Free Network Exploration
13. New Bounds for Online Packing LPs
14. A (7/2)-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
15. Drawing HV-Restricted Planar Graphs
16. Periodic Planar Straight-Frame Drawings with Polynomial Resolution
17. An Improved Data Stream Algorithm for Clustering
18. Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces
19. Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
20. Computing the Degeneracy of Large Graphs
21. Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems
22. (Total) Vector Domination for Graphs with Bounded Branchwidth
23. Computing in the Presence of Concurrent Solo Executions
24. A Characterization of Those Automata That Structurally Generate Finite Groups
25. On the Computability of Relations on λ-Terms and Rice’s Theorem - The Case of the Expansion Problem for Explicit Substitutions
26. Sorting Permutations by Prefix and Suffix Versions of Reversals and Transpositions
27. Linear Grammars with One-Sided Contexts and Their Automaton Representation
28. The Planar Slope Number of Subcubic Graphs
29. Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time
30. Smooth Orthogonal Drawings of Planar Graphs
31. A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters
32. Optimal Algorithms for Constrained 1-Center Problems
33. Biased Predecessor Search
34. Budget Feasible Mechanisms for Experimental Design
35. Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs
36. Quad-K-d Trees
37. LZ77-Based Self-indexing with Faster Pattern Matching
38. Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds
39. A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width
40. Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line
41. False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time
42. Connected Greedy Colourings
43. On the Stability of Generalized Second Price Auctions with Budgets
44. Approximation Algorithms for the Max-Buying Problem with Limited Supply
45. Algorithmic and Hardness Results for the Colorful Components Problems
46. Survivability of Swarms of Bouncing Robots
47. Semantic Word Cloud Representations: Hardness and Approximation Algorithms
48. A Divide and Conquer Method to Compute Binomial Ideals
49. How Fast Can We Multiply Large Integers on an Actual Computer?
50. Emergence of Wave Patterns on Kadanoff Sandpiles
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.