{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":54,"n_cols":5,"rows_kept":54,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[22,2,22,3],[23,2,23,3],[27,2,27,3],[29,2,29,3],[29,4,29,5],[30,2,30,3],[30,4,30,5],[31,2,31,3],[31,4,31,5],[32,2,32,3],[34,2,34,3],[35,2,35,3],[36,2,36,3],[37,2,37,3],[38,2,38,3],[39,2,39,3],[47,2,47,3],[48,2,48,3],[51,2,51,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996465859403316"]
[null,null,"Titolo",null,"Computing and Combinatorics [[electronic resource] ] : 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010 Proceedings / / edited by My T. Thai, Sartaj Sahni"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010"]
[null,null,"ISBN",null,"1-280-38756-4"]
[{"$nulls":4},"9786613565488"]
[{"$nulls":4},"3-642-14031-9"]
[null,null,"Edizione",null,"[1st ed. 2010.]"]
[null,null,"Descrizione fisica",null,"1 online resource (553 p. 103 illus.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 6196"]
[null,null,"Disciplina",null,"511/.6"]
[null,null,"Soggetti",null,"Algorithms"]
[{"$nulls":4},"Computer science—Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Computer networks"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Computer graphics"]
[{"$nulls":4},"Artificial intelligence"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Computer Communication Networks"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Computer Graphics"]
[{"$nulls":4},"Artificial Intelligence"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Invited Talks -- Understanding and Inductive Inference -- Computing with Cells: Membrane Systems -- Complexity and Inapproximability -- Boxicity and Poset Dimension -- On the Hardness against Constant-Depth Linear-Size Circuits -- A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model -- The Curse of Connectivity: t-Total Vertex (Edge) Cover -- Counting Paths in VPA Is Complete for #NC 1 -- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas -- Approximation Algorithms -- Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing -- "]
[{"$nulls":4},"Clustering with or without the Approximation -- A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks -- Approximate Weighted Farthest Neighbors and Minimum Dilation Stars -- Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs -- Graph Theory and Algorithms -- Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph -- Triangle-Free 2-Matchings Revisited -- The Cover Time of Deterministic Random Walks -- Finding Maximum Edge Bicliques in Convex Bipartite Graphs -- A Note on Vertex Cover in Graphs with Maximum Degree 3 -- Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming -- Factorization of Cartesian Products of Hypergraphs -- Graph Drawing and Coloring -- Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs -- On Three Parameters of Invisibility Graphs -- Imbalance Is Fixed Parameter Tractable -- The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs -- Computational Geometry -- Optimal Binary Space Partitions in the Plane -- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems -- Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux -- Detecting Areas Visited Regularly -- Tile-Packing Tomography Is -hard -- The Rectilinear k-Bends TSP -- Tracking a Generator by Persistence -- Auspicious Tatami Mat Arrangements -- Automata, Logic, Algebra and Number Theory -- Faster Generation of Shorthand Universal Cycles for Permutations -- The Complexity of Word Circuits -- On the Density of Regular and Context-Free Languages -- Extensions of the Minimum Cost Homomorphism Problem -- The Longest Almost-Increasing Subsequence -- Universal Test Sets for Reversible Circuits -- Approximate Counting with a Floating-Point Counter -- Network Optimization and Scheduling Algorithm -- Broadcasting in Heterogeneous Tree Networks -- Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks -- Online Preemptive Scheduling with Immediate Decision or Notification and Penalties -- Computational Biology and Bioinformatics -- Discovering Pairwise Compatibility Graphs -- Near Optimal Solutions for Maximum Quasi-bicliques -- Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial -- Constant Time Approximation Scheme for Largest Well Predicted Subset -- On Sorting Permutations by Double-Cut-and-Joins -- A Three-String Approach to the Closest String Problem -- A 2k Kernel for the Cluster Editing Problem -- Data Structure and Sampling Theory -- On the Computation of 3D Visibility Skeletons -- The Violation Heap: A Relaxed Fibonacci-Like Heap -- Threshold Rules for Online Sample Selection -- Heterogeneous Subset Sampling -- Cryptography, Security, Coding and Game Theory -- Identity-Based Authenticated Asymmetric Group Key Agreement Protocol -- Zero-Knowledge Argument for Simultaneous Discrete Logarithms -- Directed Figure Codes: Decidability Frontier."]
[null,"2.","Record Nr.",null,"UNISA996659458203316"]
[null,null,"Autore",null,"Campagnolo Yan"]
[null,null,"Titolo",null,"Artificial Intelligence's Impact on Legal Journals / Incidence de l'intelligence Artificielle Sur les Revues de Droit : Challenges and Opportunities for the Ottawa Law Review / défis et Possibilités Pour la Revue de Droit D'Ottawa"]
[null,null,"Pubbl/distr/stampa",null,"Ottawa : , : University of Ottawa Press/Les Presses de l'Universite d'Ottawa, , 2025"]
[{"$nulls":4},"©2025"]
[null,null,"ISBN",null,"0-7766-4528-5"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (130 pages)"]
[null,null,"Collana",null,"Law, Technology, and Media Series"]
[null,null,"Disciplina",null,"070.5/94028563"]
[null,null,"Soggetti",null,"Artificial intelligence"]
[{"$nulls":4},"Law reviews - Canada"]
[{"$nulls":4},"Law"]
[{"$nulls":4},"Research - Data processing"]
[{"$nulls":4},"Scholarly periodicals - Publishing - Technological innovations"]
[{"$nulls":4},"Scholarly publishing"]
[{"$nulls":4},"LAW / Ethics & Professional Responsibility"]
[{"$nulls":4},"Electronic books."]
[null,null,"Lingua di pubblicazione",null,"Francese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"Frontmatter -- Abstract -- Table of Contents -- 1 INTRODUCTION -- 2 HOW JOURNALS ARE RESPONDING TO AI -- 3 CHALLENGES -- 4 OPPORTUNITIES -- 5 RECOMMENDATIONS -- 6 CONCLUSION -- 7 APPENDICES -- 8 REFERENCES -- 9 ACKNOWLEDGEMENTS -- Law, Technology, and Media -- Front matter 2 -- À PROPOS DE LA REVUE DE DROIT D’OTTAWA -- Résumé -- Table des matières -- 1 INTRODUCTION -- 2 COMMENT LES REVUES RÉPONDENT-ELLES À L’IA -- 3 DÉFIS -- 4 POSSIBILITÉS EN LIEN AVEC L'IA -- 5 RECOMMANDATIONS -- 6 CONCLUSION -- 7 ANNEXES -- 8 RÉFÉRENCES -- 9 REMERCIEMENTS -- Droit, technologie et médias"]
[null,null,null,"Sommario/riassunto","\"This book provides an overview of the opportunities and challenges presented by the use of artificial intelligence (AI) and its impact on legal journals, notably the Ottawa Law Review (OLR). Throughout the publication lifecycle of a given piece, AI tools may play a pivotal role in enhancing the editorial and publishing processes. Similarly, authors "]
[{"$nulls":4},"submitting to legal journals may also leverage AI tools for purposes that range from improving readability to content generation. While the potential benefits are significant, the use of such tools raises various issues pertaining to the accuracy and quality of publications, as well as broader ethical and legal issues. Journals--both legal and non-legal--have responded to these opportunities and challenges at different speeds and in different ways. Some journals in non-legal disciplines have developed extensive AI policies, while the majority of legal journals--particularly in Canada--appear to be falling behind in this regard. This report contains several recommendations that will empower the OLR to embrace the transformative potential of AI responsibly while maintaining its commitment to safeguarding privacy, intellectual property, and scholarly rigour. Central to this endeavour is the adoption of three AI policies: one covering the use of generative AI and AI-assisted technologies in submissions, another addressing AI usage in the peer review process, and a final one relating to the editorial team. This report ultimately aspires to ensure the OLR upholds its reputation as a reliable contributor to legal scholarship by guiding the organization through this new technological revolution.\"--"]