Computing boundary cycle of a pseudo-triangle polygon from its visibility graph

DOI10.1007/978-3-030-57852-7_5OpenAlexW3082636863MaRDI QIDQ1997264FDOQ1997264

Hossein Boomari, Soheila Farokhi

Publication date: 1 March 2021

Full work available at URL: https://arxiv.org/abs/2002.06712

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Theory of computing (68Qxx)

Cites Work

• Founding Cryptography on Oblivious Transfer – Efficiently
• Non-malleability amplification
• Advances in Cryptology – CRYPTO 2004
• New notions of security
• Title not available (Why is that?)
• A unified framework for concurrent security
• Theory of Cryptography
• On Adaptively Secure Protocols
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Bounded-concurrent secure two-party computation without setup assumptions
• Lossy Trapdoor Functions and Their Applications
• Black-box constructions for secure computation
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Theory of Cryptography
• Round-Efficient Black-Box Construction of Composable Multi-Party Computation
• Black-Box Constructions of Composable Protocols without Set-Up
• Round-Optimal Black-Box Two-Party Computation
• Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way
• A Unified Framework for UC from Only OT
• Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol

This page was built for publication: Computing boundary cycle of a pseudo-triangle polygon from its visibility graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1997264)