English
Related papers

Related papers: Why the same key can open different padlocks?

200 papers

We define simple variants of zip trees, called zip-zip trees, which provide several advantages over zip trees, including overcoming a bias that favors smaller keys over larger ones. We analyze zip-zip trees theoretically and empirically,…

Data Structures and Algorithms · Computer Science 2025-02-11 Ofek Gila , Michael T. Goodrich , Robert E. Tarjan

Zigzags in graphs embedded in surfaces are cyclic sequences of edges whose any two consecutive edges are different, have a common vertex and belong to the same face. We investigate zigzags in randomly constructed combinatorial tetrahedral…

Combinatorics · Mathematics 2022-06-22 Adam Tyc

We produce embeddings of knots in thin position that admit compressible thin levels. We also find the bridge number of tangle sums where each tangle is high distance.

Geometric Topology · Mathematics 2016-01-20 Ryan Blair , Alexander Zupan

Polymetric walls are walls built from bricks in more than one size. Architects and builders want to built polymetric walls that satisfy certain structural and aesthetical constraints. In a recent paper by de Jong, Vinduska, Hans and Post…

Combinatorics · Mathematics 2012-06-04 Michel Dekking

A necklace is an equivalence class of words of length $n$ over an alphabet under the cyclic shift (rotation) operation. As a classical object, there have been many algorithmic results for key operations on necklaces, including counting,…

Combinatorics · Mathematics 2021-11-08 Duncan Adamson , Argyrios Deligkas , Vladimir V. Gusev , Igor Potapov

We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…

Metric Geometry · Mathematics 2017-12-05 A. J. Kanel-Belov , A. V. Dyskin , Y. Estrin , E. Pasternak , I. A. Ivanov-Pogodaev

The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J.…

Geometric Topology · Mathematics 2017-05-31 Andrey Boris Khesin

In 1968, Liu described the problem of securing documents in a shared secret project. In an example, at least six out of eleven participating scientists need to be present to open the lock securing the secret documents. Shamir proposed a…

Cryptography and Security · Computer Science 2021-03-31 Jannik Dreier , Jean-Guillaume Dumas , Pascal Lafourcade , Léo Robert

This document describes the symmetric encryption algorithm called Puzzle. It is free and open. The objective of this paper is to get an opinion about its security from the cryptology community. It is separated in two parts, a technical…

Cryptography and Security · Computer Science 2013-09-10 Gregory Alvarez , Charles Berenguer

We introduce a one-person game that we call Padlock Solitaire which resembles the well-known clock solitaire card game. Analyzing variants of this game we obtain simple proofs of some classical results of combinatorics including ballot…

Combinatorics · Mathematics 2020-09-01 Johan Wästlund

In this paper, we propose novel methods for constructing uninorms using two comparable closure operators or, alternatively, two comparable interior operators on bounded lattices. These methods are developed under the necessary and…

Functional Analysis · Mathematics 2025-05-08 Zhenyu Xiu , Xu Zheng

The outsourced manufacturing of integrated circuits has increased the risk of intellectual property theft. In response, logic locking techniques have been developed for protecting designs by adding programmable elements to the circuit.…

Cryptography and Security · Computer Science 2021-03-15 Joseph Sweeney , Deepali Garg , Lawrence Pileggi

An equilateral stick number $s_{=}(K)$ of a knot $K$ is defined to be the minimal number of sticks required to construct a polygonal knot of $K$ which consists of equal length sticks. Rawdon and Scharein [12] found upper bounds for the…

Geometric Topology · Mathematics 2014-01-30 Hyoungjun Kim , Sungjong No , Seungsang Oh

Modern hardware environments are becoming increasingly heterogeneous, leading to the emergence of applications specifically designed to exploit this heterogeneity. Efficiently adopting locks in these applications poses distinct challenges.…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-08-12 Hanze Zhang , Rong Chen , Haibo Chen

We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged…

In this paper, we present an algorithmic approach to design and construct planar truss structures based on symmetric lattices using modular elements. The method of assembly is similar to Leonardo grids as they both rely on the property of…

Graphics · Computer Science 2021-06-22 Anantha Natarajan , Jiaqi Cui , Ergun Akleman , Vinayak Krishnamurthy

The lattice stick number of a knot type is defined to be the minimal number of straight line segments required to construct a polygon presentation of the knot type in the cubic lattice. In this paper, we mathematically prove that the…

Geometric Topology · Mathematics 2015-12-14 Youngsik Huh , Seungsang Oh

We consider secret key generation for a "pairwise independent network" model in which every pair of terminals observes correlated sources that are independent of sources observed by all other pairs of terminals. The terminals are then…

Information Theory · Computer Science 2010-08-09 Sirin Nitinawarat , Chunxuan Ye , Alexander Barg , Prakash Narayan , Alex Reznik

The outsourcing of semiconductor manufacturing raises security risks, such as piracy and overproduction of hardware intellectual property. To overcome this challenge, logic locking has emerged to lock a given circuit using additional key…

Cryptography and Security · Computer Science 2025-01-30 Kevin Lopez , Amin Rezaei

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke