Computing boundary cycle of a pseudo-triangle polygon from its visibility graph (Q1997264): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3082636863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-box constructions for secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Founding Cryptography on Oblivious Transfer – Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-Efficient Black-Box Construction of Composable Multi-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-malleability amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Constructions of Composable Protocols without Set-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for concurrent security / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-concurrent secure two-party computation without setup assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-Optimal Black-Box Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-concurrent secure multi-party computation with a dishonest majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Framework for UC from Only OT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Constructions of Two-Party Protocols from One-Way Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Trapdoor Functions and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: New notions of security / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Adaptively Secure Protocols / rank
 
Normal rank

Latest revision as of 16:26, 24 July 2024

scientific article
Language Label Description Also known as
English
Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
scientific article

    Statements

    Computing boundary cycle of a pseudo-triangle polygon from its visibility graph (English)
    0 references
    0 references
    0 references
    1 March 2021
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references