#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2005

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- László Csirmaz, Péter Ligeti
- Computing
- 2009

In this paper we consider the secret sharing problem on special access structures with minimal qualified subsets of size two, i.e. secret sharing on graphs. This means that the participants are the… (More)

- László Csirmaz, Péter Ligeti, Gábor Tardos
- Graphs and Combinatorics
- 2015

A new, constructive proof with a small explicit constant is given to the Erdős-Pyber theorem which says that the edges of a graph on n vertices can be partitioned into complete bipartite subgraphs so… (More)

- Péter L. Erdös, Péter Ligeti, Péter Sziklai, David C. Torney
- Combinatorial and Algorithmic Foundations of…
- 2006

We examine finite words over an alphabet Γ = {

- Szabolcs L. Fancsali, Péter Ligeti
- J. Mathematical Cryptology
- 2008

- Péter Ligeti, Péter Sziklai
- Discrete Mathematics
- 2005

In this paper the automorphism group of two posets, Dk,n and Bm,n is determined. Dk,n is the poset of DNA strands of length at most n, built up with k complement pairs of letters, and partially… (More)

- Mihály Bárász, Balazs Boros, Péter Ligeti, Krisztina Lója, Daniel A. Nagy
- 2007 Third International Conference on Security…
- 2007

We have broken EMAP (Efficient Mutual Authentication Protocol), which is a mutual authentication protocol between RFID tags and RFID readers. We give an algorithm, which breaks the protocol after… (More)

- István Miklós, Timothy Brooks Paige, Péter Ligeti
- WABI
- 2006

The evolutionary distance between two organisms can be determined by comparing the order of appearance of orthologous genes in their genomes. Above the numerous parsimony approaches that try to… (More)

- Géza Kós, Péter Ligeti, Péter Sziklai
- Math. Comput.
- 2009

For an arbitrary matrix A of n×n symbols, consider its submatrices of size k×k, obtained by deleting n−k rows and n−k columns. Optionally, the deleted rows and columns can be selected symmetrically… (More)

- Péter Ligeti
- 2008

In the paper two variants of a combinatorial problem for the set F q of sequences of length n over the alphabet Fq = {0, 1, .., q − 1} are considered, with some applications. The original problem was… (More)

- Mihály Bárász, Péter Ligeti, László Mérai, Daniel A. Nagy
- Periodica Mathematica Hungarica
- 2012

Sealed bid auctions are a popular means of high-stakes bidding, as they eliminate the temporal element from the auction process, allowing participants to take less emotional, more thoughtful… (More)