Andrej Brodnik

According to our database1, Andrej Brodnik
  • authored at least 42 papers between 1994 and 2018.
  • has a "Dijkstra number"2 of four.



In proceedings 
PhD thesis 




Tensions in specifying computing curricula for K-12: Towards a principled approach for objectives.
it - Information Technology, 2018

Sliding Suffix Tree.
CoRR, 2018

Guest editorial for special section on a new culture of learning: Developing computing in the curriculum and advancing digital pedagogy.
EAIT, 2017

Solving all-pairs shortest path by single-source computations: Theory and practice.
Discrete Applied Mathematics, 2017

Activation of Computer Science Teachers in Slovenia.
Proceedings of the Tomorrow's Learning: Involving Everyone. Learning with and about Technologies and Computing, 2017

Modelling Time-Series of Glucose Measurements from Diabetes Patients Using Predictive Clustering Trees.
Proceedings of the Artificial Intelligence in Medicine, 2017

Increasing the throughput of machine translation systems using clouds.
CoRR, 2016

ERA Revisited: Theoretical and Experimental Evaluation.
CoRR, 2016

Editors' Introduction to the Special Issue on "MATCOS-13 conference".
Informatica (Slovenia), 2015

Parallel Query in the Suffix Tree.
CoRR, 2015

Design and deployment of eHealth interventions using behavior change techniques, BPMN2 and OpenEHR.
Proceedings of the 11th IEEE International Conference on Wireless and Mobile Computing, 2015

A High-Availability Bebras Competition System.
Proceedings of the Informatics in Schools. Teaching and Learning Perspectives, 2014

Hard and soft security provisioning for computationally weak pervasive computing systems in E-health.
IEEE Wireless Commun., 2013

The Encoding Complexity of Two Dimensional Range Minimum Data Structures.
Proceedings of the Algorithms - ESA 2013, 2013

Speeding up shortest path algorithms
CoRR, 2012

Reality Considerations When Designing a TDMA-FDMA Based Link-Layer for Real-Time WSN.
Proceedings of the Multiple Access Communications - 5th International Workshop, 2012

Speeding Up Shortest Path Algorithms.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Computer Aided Melodic Analysis using Suffix Tree.
Proceedings of the Non-Cochlear Sound: Proceedings of the 38th International Computer Music Conference, 2012

Planning Smooth and Obstacle-Avoiding B-Spline Paths for Autonomous Mining Vehicles.
IEEE Trans. Automation Science and Engineering, 2010

Unit-Time Predecessor Queries on Massive Data Sets.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

An Adaptive BIC Approach for Robust Speaker Change Detection in Continuous Audio Streams.
Proceedings of the Text, Speech and Dialogue, 12th International Conference, 2009

An adaptive BIC approach for robust audio stream segmentation.
Proceedings of the INTERSPEECH 2009, 2009

A practical approach to the 2D incremental nearest-point problem suitable for different point distributions.
Pattern Recognition, 2008

An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture
CoRR, 2006

An O(1) Solution to the Prefix Sum Problem on a Specialized Memory Architecture.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Worst case constant time priority queue.
Journal of Systems and Software, 2005

Supplementary services in telecommunication next generation networks.
Proceedings of the Managing Next Generation Convergence Networks and Services, 2004

Static Data Structure for Discrete Advance Bandwidth Reservations on the Internet
CoRR, 2003

Data Structure for a Time-Based Bandwidth Reservations Problem
CoRR, 2003

Extended Expedited Forwarding: the In-Time PHB group.
Proceedings of the Eighth IEEE Symposium on Computers and Communications (ISCC 2003), 30 June, 2003

Online Routing in Convex Subdivisions.
Int. J. Comput. Geometry Appl., 2002

Worst case constant time priority queue.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Multiprocess Time Queue.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Online Routing in Convex Subdivisions.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Membership in Constant Time and Almost-Minimum Space.
SIAM J. Comput., 1999

Resizable Arrays in Optimal Time and Space.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Efficient Handling of Sparse Matrices in Animal Breeding.
Proceedings of the Large-Scale Scientific Computation for Engineering and Environmental Problems, 1999

Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Small Forwarding Tables for Fast Routing Lookups.
Proceedings of the ACM SIGCOMM 1997 Conference on Applications, 1997

Comments on Self-Indexed Sort.
SIGPLAN Notices, 1996

Neighbours on a Grid.
Proceedings of the Algorithm Theory, 1996

Membership in Constant Time and Minimum Space.
Proceedings of the Algorithms, 1994