Xu LWen DQin LLi RZhang YLin X(2024)Constant-time Connectivity Querying in Dynamic GraphsProceedings of the ACM on Management of Data10.1145/36988052:6(1-23)Online publication date: 20-Dec-2024
https://dl.acm.org/doi/10.1145/3698805
Mao XMohar BShinkar IO'Donnell R(2024)Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update TimeProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649695(1141-1152)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649695
Haeupler BLong YSaranurak T(2024)Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\epsilon}$ Worst-Case Update Time2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00121(2033-2044)Online publication date: 27-Oct-2024
https://doi.org/10.1109/FOCS61266.2024.00121
Show More Cited By

Index Terms

An On-Line Edge-Deletion Problem
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Divisible On-Line/Off-Line Signatures
CT-RSA '09: Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology

On-line/Off-line signatures are used in a particular scenario where the signer must respond quickly once the message to be signed is presented. The idea is to split the signing procedure into two phases: the off-line and on-line phases. The signer can ...
On-line versus off-line accelerated kernel feature analysis: Application to computer-aided detection of polyps in CT colonography

A semi-supervised learning method, the on-line accelerated kernel feature analysis (On-line AKFA) is presented. In On-line AKFA, features are extracted while data are being fed to the algorithm in small batches as the algorithm proceeds. The paper ...
Is the Notion of Divisible On-Line/Off-Line Signatures Stronger than On-Line/Off-Line Signatures?
ProvSec '09: Proceedings of the 3rd International Conference on Provable Security

On-line/Off-line signatures are useful in many applications where the signer has a very limited response time once the message is presented. The idea is to perform the signing process in two phases. The first phase is performed <em>off-line</em> before ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 28, Issue 1

Jan. 1981

190 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322234

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1981

Published in JACM Volume 28, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

201
Total Citations
View Citations
2,514
Total Downloads

Downloads (Last 12 months)365
Downloads (Last 6 weeks)51

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Xu LWen DQin LLi RZhang YLin X(2024)Constant-time Connectivity Querying in Dynamic GraphsProceedings of the ACM on Management of Data10.1145/36988052:6(1-23)Online publication date: 20-Dec-2024
https://dl.acm.org/doi/10.1145/3698805
Mao XMohar BShinkar IO'Donnell R(2024)Fully Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update TimeProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649695(1141-1152)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649695
Haeupler BLong YSaranurak T(2024)Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\epsilon}$ Worst-Case Update Time2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00121(2033-2044)Online publication date: 27-Oct-2024
https://doi.org/10.1109/FOCS61266.2024.00121
Van Den Brand JChen LKyng RLiu YMeierhans SGutenberg MSachdeva S(2024)Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00120(2010-2032)Online publication date: 27-Oct-2024
https://doi.org/10.1109/FOCS61266.2024.00120
Cohen ENelson JSarlós TStemmer UWilliams BChen YNeville J(2023)Tricking the hashing trickProceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence10.1609/aaai.v37i6.25882(7235-7243)Online publication date: 7-Feb-2023
https://dl.acm.org/doi/10.1609/aaai.v37i6.25882
Forster SNazari YProbst Gutenberg MSaha BServedio R(2023)Deterministic Incremental APSP with Polylogarithmic Update Time and StretchProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585213(1173-1186)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585213
Chuzhoy JZhang RSaha BServedio R(2023)A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest PathsProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585196(1159-1172)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585196
Van Den Brand JKarczmarz A(2023)Deterministic Fully Dynamic SSSP and More2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00142(2312-2321)Online publication date: 6-Nov-2023
https://doi.org/10.1109/FOCS57990.2023.00142
Abboud ALi JPanigrahi DSaranurak T(2023)All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00137(2204-2212)Online publication date: 6-Nov-2023
https://doi.org/10.1109/FOCS57990.2023.00137
Wang WKarimi FKhalilpour KGreen DVarvarigos M(2023)Robustness analysis of electricity networks against failure or attack: The case of the Australian National Electricity Market (NEM)International Journal of Critical Infrastructure Protection10.1016/j.ijcip.2023.10060041(100600)Online publication date: Jul-2023
https://doi.org/10.1016/j.ijcip.2023.100600
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Divisible On-Line/Off-Line Signatures

On-line versus off-line accelerated kernel feature analysis: Application to computer-aided detection of polyps in CT colonography

Is the Notion of Divisible On-Line/Off-Line Signatures Stronger than On-Line/Off-Line Signatures?

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations